#define  _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144 * 4LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

void init() {
    iostream::sync_with_stdio(false);
    cout << fixed << setprecision(20);
}


#define int ll

unsigned long xor128() {
    static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned long t = (x ^ (x << 11));
    x = y; y = z; z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

ll exec(int a, int b, int c) {
    int three = b / 3LL - (a - 1LL) / 3LL;
    int five = b / 5LL - (a - 1LL) / 5LL;
    int x = b / 15LL - (a - 1LL) / 15LL;

    int bobo = b - a + 1LL - (three + five - x);
    ll ans = bobo * c + (three + five) * 4;
    return ans;
}

void solve(){
    ll s;
    cin >> s;
    int now = 9;
    for (int i = 1;; ++i) {
        int bot = now / 9;
        int top = (now / 9LL) * 10LL - 1LL;
        if (exec(bot, top, i) < s) {
            s -= exec(bot, top, i);
        }
        else {
            ll bott = bot - 1;
            int topp = top;
            while (topp - bott > 1) {
                ll mid = (topp + bott) / 2LL;
                if (exec(bot, mid, i) < s) {
                    bott = mid;
                }
                else {
                    topp = mid;
                }
            }
            s -= exec(bot, bott, i);
            string c;
            for (int i = bott + 1; c.length() <= 50; ++i) {
                if (i % 15 == 0) {
                    c += "FizzBuzz";
                }
                else if (i % 5 == 0) {
                    c += "Buzz";
                }
                else if (i % 3 == 0) {
                    c += "Fizz";
                }
                else {
                    c += to_string(i);
                }
            }
            for (int q = 0; q < 20; ++q) {
                cout << c[q + s - 1];
            }
            cout << endl;
            return;
        }
        now *= 10LL;
    }
}

#undef int
int main() {
    init();
    solve();
}
