# include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include 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 Pll; LL n, m, a[1000000] = {}, sum, ans = 0; bitset<10000>bi[10] = {}; string st[2]; int main() { cin >> n; m = n; bool fb[2] = {}, FF = 1; if (n % 3 == 0)fb[0] = 1; while (1) { if (n != 0) { sum = (sum + (FF == 1 ? n % 10 : (n % 10) * 4)) % 5; FF = !FF; n = n / 10; } 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; }