/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll INF = 1e18;

V vec;
ll n, k;
bool judge(ll x)
{
    ll cnt = 0;
    ll prev = x;
    while (1)
    {
        ll f = lower_bound(all(vec), prev) - vec.begin();
        if (f == n)
            break;
        cnt++;
        prev = vec[f];
    }
    return cnt <= k;
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    string s=to_string(n);
    ll res=0;
    rep(i,s.size()){
        res += (s[i] - '0') * pow(4, s.size() - i - 1);
    }
   // cout<<res<<endl;
    if(res%5==0&&res%3==0){
        cout << "FizzBuzz" << endl;
    }else if(res%3==0){
        cout << "Fizz" << endl;
    }else if(res%5==0){
        cout << "Buzz" << endl;
    }else{
        cout << n << endl;
    }
}