#include<bits/stdc++.h>
#define REP(i,n,N) for(ll i=(n);i<(ll)(N);i++)
#define p(s) cout<<(s)<<endl;
typedef long long ll;
using namespace std;

ll calc(ll k,ll l,ll r) {
	ll F=(r-1)/3-(l-1)/3;
	ll B=(r-1)/5-(l-1)/5;
	ll FB=(r-1)/15-(l-1)/15;
	ll ret=k*((r-l)-(F+B)+FB)+(F+B)*4;//num + (Fizz or Buzz)
	return ret;
}

ll C(ll n) {
	ll ret=0;
	string S=to_string(n);
	REP(i,1,S.size()) {
		ret+=calc(i,pow(10,i-1),pow(10,i));
	}
	ret += calc(S.size(),pow(10,S.size()-1),n+1);
	return ret;
}
int main() {
	ll s;
	cin>>s;
	ll lb=0, ub=1e18;
	while(ub-lb>1) {
		ll mid=(lb+ub)/2;
		if(C(mid)<=s) {
			lb=mid;
		}
		else ub=mid;
	}
	string str;
	REP(i,lb,lb+40) {
		if(str.size()>40)	break;
		if(i%15==0) str+="FizzBuzz";
		else if(i%3==0) str+="Fizz";
		else if(i%5==0) str+="Buzz";
		else str+=to_string(i);
	}
	cout<<str.substr(s-C(lb-1)-1,20)<<endl;
	return 0;
}