#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
typedef long long ll;

int main() {

    string S; cin >> S;

    long long N1 = 0, N2 = 0;
    bool flag1 = false;
    bool flag2 = false;
    REP(i,S.size()) {
        N1 *= 4;
        N1 += (S[i] - '0');
        if (N1 % 3 == 0) flag1 = true;
        N1 %= 3;
        N2 *= 4;
        N2 += (S[i] - '0');
        if (N2 % 5 == 0) flag2 = true;
        N2 %= 5;
    }

    if (flag1 & flag2) {
        cout << "FizzBuzz" << endl;
    } else if (flag1) {
        cout << "Fizz" << endl;
    } else if (flag2) {
        cout << "Buzz" << endl;
    } else {
        cout << S << endl;
    }

    return 0;
}