#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using uInt = long long unsigned int;
using Double = long double;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//edit
class Solve {
public:

    // [1, n) の文字数をカウント
    Int count(Int n) {
        Int ret = 0;


        for (Int d = 1, keta = 1;; d *= 10, keta++) {
            // [d, d * 10)
            if (d * 10 < n) {
                ret += keta * (d * 10 - d);

                auto dec_x = [&](Int d, Int x) {
                    Int ret = ((10 * d - 1) / x - (d - 1) / x);
                    return ret;
                };

                Int dec3 = dec_x(d, 3);
                Int dec5 = dec_x(d, 5);
                Int dec15 = dec_x(d, 15);

                ret -= dec3 * keta;
                ret -= dec5 * keta;
                ret += dec15 * keta;

                // Fizz and Buzz
                ret += dec3 * 4; // Fizz
                ret += dec5 * 4; // Buzz


            } else {
                ret += keta * (n - d);

                auto dec_x = [&](Int d, Int x) {
                    Int ret = ((n - 1) / x - (d - 1) / x);
                    return ret;
                };

                Int dec3 = dec_x(d, 3);
                Int dec5 = dec_x(d, 5);
                Int dec15 = dec_x(d, 15);

                ret -= dec3 * keta;
                ret -= dec5 * keta;
                ret += dec15 * keta;

                // Fizz and Buzz
                ret += dec3 * 4; // Fizz
                ret += dec5 * 4; // Buzz


                break;
            }
        }

        return ret;
    }

    string g(Int x) {
        string ret;
        if (x % 3 == 0) {
            ret += "Fizz";
        }
        if (x % 5 == 0) {
            ret += "Buzz";
        }
        if (ret.size() == 0) {
            ret += to_string(x);
        }

        return ret;
    }


    void solve() {
//        for (Int i = 0, j = 1; i < 19; ++i, j *= 10) {
//            cout << j << " " << count(j) << endl;
//        }

        Int n;
        cin >> n;
//        if (n < 10) {
//            string s;
//            for (int i = 1; i < 100; ++i) {
//                s += g(i);
//            }
//            string ans = s.substr(n - 1, 20);
//            cout << ans << endl;
//
//
//            return;
//        }


        Int lb = 1;
        Int ub = 100000000000000000ll;

        while (ub - lb > 1) {
            Int mid = (lb + ub) / 2;

            Int val = count(mid);
            if (val >= n) {
                ub = mid;
            } else {
                lb = mid;
            }
        }

        Int x = lb;
        Int fx = count(x);
        string s;
        for (Int y = x; s.size() <= n + 20 - (fx + 1); ++y) {
            s += g(y);
        }
        string ans = s.substr(n - fx - 1, 20);
        cout << ans << endl;


    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    Solve().solve();


    return 0;
}



Measured memory_bytes: 3300