#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cstdio>
using namespace std;
typedef long long int ll;

ll n;

ll fblen(ll n){
	ll d=10;
	ll ans = 0;
	ll under = 0;
	for(ll i=1;under < n;i++){
		ll to;
		if((under+1)*10-1 <= n) to = (under+1)*10-1;
		else to = n;
		ll FizzBuzz = to/15 - under/15;
		ll Fizz = to/3 - under/3 - FizzBuzz;
		ll Buzz = to/5 - under/5 - FizzBuzz;
		ll normal = to - under - Fizz - Buzz - FizzBuzz;
		ans += Fizz*4 + Buzz*4 + FizzBuzz*8 + normal*i;
		under = to;
	}
	return ans;
}
string toStr(ll n){
	return n ? (toStr(n/10) + (char)(n%10+'0')) : "";
}
int main(){
	while(cin >> n){
		ll l=1,r=n;
		while(l<r-1){
			ll mid = (r+l)/2;
			if(fblen(mid) < n) l = mid;
			else r = mid;
		}
		string s="";
		for(ll i=l;i<l+20;i++) s += i%15 ? (i%3 ? (i%5 ? toStr(i) : "Buzz") : "Fizz") : "FizzBuzz";
		cout << s.substr(n-fblen(l-1)-1, 20) << endl;
	}
	return 0;
}