#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)
#define EQ(a,b) (abs((a)-(b))<eps)
ll n;
ll rui[20];
ll cnt(ll a,ll b,ll d){ // (a,b]
	return b/d-a/d;
}
ll fizzbuzz_len(ll x){
	ll rem = x;
	ll len = 0ll;
	for(int i=0;;i++){
		if(rem>=rui[i]*9ll){
			ll len8 = cnt(rui[i]-1,rui[i+1]-1,15ll);
			ll len4 = cnt(rui[i]-1,rui[i+1]-1,3ll)+cnt(rui[i]-1,rui[i+1]-1,5ll)-len8*2ll;
			ll ret = rui[i]*9-len8-len4;
			ll s = ret*(ll)(i+1)+len4*4+len8*8;
			rem -= rui[i]*9;
			len += s;
		}else{
			ll len8 = cnt(rui[i]-1,x,15ll);
			ll len4 = cnt(rui[i]-1,x,3ll)+cnt(rui[i]-1,x,5ll)-len8*2ll;
			ll ret = (x-rui[i]+1ll)-len8-len4;
			ll s = ret*(ll)(i+1)+len4*4+len8*8;
			len += s;
			break;
		}
	}
	return len;
}
string fizzbuzz(ll x){
	if(x%15==0)return "FizzBuzz";
	if(x%3==0)return "Fizz";
	if(x%5==0)return "Buzz";
	string ret;
	while(x){
		ret+=(x%10)+'0';
		x/=10;
	}
	reverse(all(ret));
	return ret;
}
int main(){
	cin >> n;
	rui[0]=1ll;
	for(int i=1;i<20;i++)rui[i]=rui[i-1]*10ll;
	ll l=0ll,r=100000000000000000ll;
	while(r-l>1ll){
		ll mid = (l+r)/2;
		if(fizzbuzz_len(mid)<n)l=mid;
		else r = mid;
	}
	int idx = n-fizzbuzz_len(l++)-1;
	string ans;
	while((int)ans.size()<idx+20){
		ans += fizzbuzz(l++);
	}
	cout << ans.substr(idx,20) << endl;
	return 0;
}