#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,li[200010]={};
string s;

int main(){
	cin >> s;
	int three=0, five=0;
	REP(i,0,s.size()) (three+=s[i]-'0')%=3;
	REP(i,0,s.size()){
		if(i%2) (five+=-(s[i]-'0'))%=5;
		else (five+=s[i]-'0')%=5;
	}
	
	if(three and five) cout << s;
	if(!three) cout << "Fizz";
	if(!five) cout << "Buzz";
	cout << endl;
	return 0;
}