#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    string s;
    cin >> s;
    int three = 0, five = 0;
    REP(i,s.length()){
        three = 4 * three + (s[i] - '0');
        five = 4 * five + (s[i] - '0');
        three %= 3;
        five %= 5;
    }

    if (!three && !five) cout << "FizzBuzz" << endl;
    else if (!three) cout << "Fizz" << endl;
    else if (!five) cout << "Buzz" << endl;
    else cout << s << endl;

    return 0;
}