//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll, ll>>>;
ll N,B,K;
ll mod=1e9+7;
vll C;

char tr(char C){
    if(C>'a'){
        return (C-'a'+'A');
    }
   else{
       return (C-'A'+'a');
   }
}

int main(){
   string N;
   cin>>N;
   ll f=0,t=0;
   reverse(all(N));
   rep(i,N.size()){
       t+=(N[i]-'0');
       f+=(i%2==0?1:-1)*(N[i]-'0');
   }
   if(t%3==0){
       cout<<"Fizz";
   }
   if(f%5==0){
       cout<<"Buzz";
   }
   if(t%3!=0&&f%5!=0){
       reverse(all(N));
       cout<<N;
   }
   cout<<endl;
}