# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = 1e17 - 10;
const double PI = acos(-1);
typedef pair<LL, LL> Pll;
LL n, m, a[1000000] = {}, sum, ans = 0, d[1000000] = {};
bitset<10000>bi[10] = {};
struct edge { LL to, cost; };
vector<edge>vec[100000];
string st[2],str;
int main() {
	cin >> str;
	bool fb[2] = {}, FF = 1;
	for (int i = 0; i < str.size(); i++) {
		sum += str[i] - '0';
	}
	if (sum % 3 == 0)fb[0] = 1;
	LL i = 0; sum = 0;
	while (1) {
		if (i < str.size()) {
			int num = (str[i] - '0');
			sum = (sum + (FF == 1 ? num % 10 : num * 4)) % 5;
			FF = !FF;
			i++;
		}
		else break;
	}
	if (sum % 5 == 0)fb[1] = 1;
	if (fb[0] == 0 && fb[1] == 0)
		cout << m << endl;
	else
		cout << (fb[0] == 1 ? (fb[1] == 1 ? "FizzBuzz" : "Fizz") : (fb[1] == 1 ? "Buzz" : "")) << endl;
	return 0;
}