#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

int s;
int d(int x) {
    int f = x/3, b = x/5, fb = x/15;
    f -= fb, b -= fb;
    int sum = 0, base = 1, adnum = 1;
    int recfbs = 0;
    while(base * 10 <= x) {
        base *= 10;
        int bb = base - 1;
        int nf = bb/3, nb = bb/5, nfb = bb/15;
        int subs = nf + nb - nfb - recfbs;
        sum += adnum * (base - base / 10 - subs);
        adnum++;
        recfbs += subs;
    }
    int nf = x/3, nb = x/5, nfb = x/15;
    int subs = nf + nb - nfb - recfbs;
    sum += adnum * (x - base + 1 - subs);
    sum += 4*f + 4*b + 8*fb;
    // printf("x = %lld, sum = %lld\n", x, sum);
    return sum;
}

signed main() {
    cin >> s;
    int ub = 1e17, lb = -1;
    while(ub - lb > 1) {
        int mid = (ub + lb) / 2;
        // printf("mid = %lld\n", mid);
        if(d(mid) >= s) ub = mid;
        else lb = mid;
    }
    
    int idx = 0;
    if(ub % 15 == 0) idx = 8;
    else if(ub % 3 == 0) idx = 4;
    else if(ub % 5 == 0) idx = 4;
    else idx = (int)to_string(ub).length();
    idx -= d(ub) - s + 1;

    string ans = "";
    while(ans.length() <= idx + 20) {
        if(ub % 15 == 0) ans += "FizzBuzz";
        else if(ub % 3 == 0) ans += "Fizz";
        else if(ub % 5 == 0) ans += "Buzz";
        else ans += to_string(ub);
        ub++;
    }
    cout << ans.substr(idx, 20) << endl;

    /*
    repq(i,1,110) {
        printf("debug(%5lld): %5lld ", i, d(i));
        if(i % 15 == 0) printf("Z");
        else if(i % 3 == 0) printf("F");
        else if(i % 5 == 0) printf("B");
        cout << endl;
    }
    */
    return 0;
}

Measured memory_bytes: 3284