#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

typedef unsigned long long ull;

//return 1??????a?????§???????????°
ull len(ull a) {
	//cout << "len " << a << endl;
	//ret = Fizz Buzz??????????????°
	ull ret = (a / 3 + a / 5) * 4;

	// [ 10^n -1 , 10^(n+1) -1 ) n=1,2,...,18
	// [0,9),[9,99),... ??¨???????????????????????°????¨????
	int l = 0; //?????°
	for (ull pow = 1; a >= pow; pow *= 10) {
		l++;
		ull L = pow - 1,
			R = min(a, pow * 10 - 2);
		//cout << " pow " << pow << " L " << L << " R " << R << endl;

		//ret += Fizz Buzz?????????????????????????????°
		ret += ((R - R / 3 - R / 5 + R / 15) - (L - L / 3 - L / 5 + L / 15))*l;
	}
	//cout << " return " << ret << endl;
	return ret;
}

int main() {
	ull s; cin >> s;

	//????????¢?´¢
	//???????????¶ L+1 == R == t????§????????????°
	ull L = 0,
		R = 100000000000000000;
	while (L + 1 < R) {
		//cout << "L " << L << " R " << R << endl;
		ull M = (L + R) / 2;
		if (len(M) >= s)
			R = M;
		else 
			L = M;
	}

	//L: R-1
	//R: t????§????????????°
	//cout << "L " << L << " R " << R << endl;

	string t = "";
	for (int i = 1; i < 20; i++) {
		if ((L + i) % 15 == 0)
			t += "FizzBuzz";
		else if ((L + i) % 3 == 0)
			t += "Fizz";
		else if ((L + i) % 5 == 0)
			t += "Buzz";
		else 
			t += to_string(L + i);
	}
	//????????°-(t????§????????????°-1)?????§???????????°-1
	//s=4; 4-len(2)-1 == (Fizz???F)
	int beg = s - len(L) - 1;
	cout << t.substr(beg, 20) << endl;

	return 0;
}