#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#define REP(i,n) for(ll i=0;i<n;i++)
typedef long long ll;

using namespace std;
int kaijo(int n){
	int ans = 1;
	if (n != 0){
		for (int i = 0; i < n; i++){
			ans *= (n - i);
		}
	}
	else{
		ans = 1;
	}
	return ans;
}

int main(){
	string s;
	ll n;
	ll q;
	int k;
	int flag, flag3, flag5;
	int a = 0;
	int b = 0;
	cin >> s;
	//q = stoi(s);
	n = s.size();
	flag = 0;
	REP(i, n){
		k = s[n-i-1]-'0';
		a += k;
		a = a % 3;
		if (flag == 0){
			b += k;
			b = b % 5;
			flag = 1;
		}
		else{
			b += 4 * k;
			b = b % 5;
			flag = 0;
		}
	}
	//cout << a << endl;
	if (a ==0 && b == 0){
		cout << "FizzBuzz" << endl;
	}
	else if (a == 0){
		cout << "Fizz" << endl;
	}
	else if(b==0){
		cout << "Buzz" << endl;
	}
	else{
		cout << s << endl;
	}
	
	//cout << q % 3 << endl;
	return 0;
}