#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	string N;
	cin >> N;
	reverse(N.begin(), N.end());
	int a3 = 1;
	int a5 = 1;
	int x3 = 0;
	int x5 = 0;
	for (int i = 0; i < N.size(); i++) {
		x3 = (x3 + a3*((int)(N[i] - '0'))) % 3;
		x5 = (x5 + a5*((int)(N[i] - '0'))) % 5;
		a3 = (a3 * 4) % 3;
		a5 = (a5 * 4) % 5;
	}
	if (x3 == 0 && x5 == 0) {
		cout << "FizzBuzz" << endl;
	}
	else if (x3 == 0) {
		cout << "Fizz" << endl;
	}
	else if (x5 == 0) {
		cout << "Buzz" << endl;
	}
	else {
		reverse(N.begin(), N.end());
		cout << N << endl;
	}
	
}