#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long ll;

ll bs(int a,int b)
{
  int c=0;
  for( int i = a; i <= b; i++ ) 
    c += (i%5==0 && i%15!=0);
  return c;
}
ll fbs(int a,int b)
{
  int c=0;
  for( int i = a; i <= b; i++ ) 
    c += (i%15==0);
  return c;
}
ll fs(int a,int b)
{
  int c=0;
  for( int i = a; i <= b; i++ ) 
    c += (i%3==0 && i%15!=0);
  return c;
}

ll fbs(ll a)
{
  return a/15;
}

ll fs(ll a)
{
  return a/3-fbs(a);
}

ll bs(ll a)
{
  return a/5-fbs(a);
}

ll age(ll a)
{
  ll z=1;
  while( z <= a ) z *= 10;
  return z;
}

ll calc(ll a)
{
  ll f,b,fb,k,z,d,lv;
  f = b = fb = k = lv = 0;
  z = 10;
  d = 1;
  while( z < age(a) ) {
    ll p = fs(z-1)-fs(z/10-1);
    ll q = bs(z-1)-bs(z/10-1);
    ll r = fbs(z-1)-fbs(z/10-1);
    f += p;
    b += q;
    fb += r;
    k += (z-z/10-p-q-r)*d;
    ++d;
    z *= 10;
  }
  /*
  ll p = -fs(z-1)+fs(a);
  ll q = -bs(z-1)+bs(a);
  ll r = -fbs(z-1)+fbs(a);
  */
  //*
  z /= 10;
  //printf("%lld\n%lld\n",z,a);
  ll p = fs(z-1)-fs(a);
  ll q = bs(z-1)-bs(a);
  ll r = fbs(z-1)-fbs(a);
  //*/
  ll s = (z-1-a-p-q-r);
  //printf("%lld %lld %lld %lld\n",p,q,r,s);
  lv += p*4+q*4+r*8+s*d;
  //printf("%lld %lld %lld %lld %lld %lld %lld\n",f,b,fb,k,z,d,lv);
  //printf("%lld\n%lld\n",f*4+b*4+fb*8+k,lv);
  return f*4+b*4+fb*8+k-lv;
}

ll sz(ll a)
{
  ll ret = 0;
  char buf[111];
  for( ll i = 1; i <= a; i++ ) {
    if( i%15 == 0 ) ret += 8;
    else if( i%5 == 0 ) ret += 4;
    else if( i%3 == 0 ) ret += 4;
    else ret += sprintf(buf,"%d",i);
  }
  return ret;
}

int main(void)
{
  ll s,l,r,m;
  scanf("%lld",&s);
  l=0;
  r=1000000000000000000ll;
  /*
  printf(":%lld\n",calc(s));
  printf(":%lld\n",sz(s));
  for( int i = 1; i <= 20; i++ ) {
    printf("%d:%lld ",i,sz(i));
  }
  puts("");
  */
  while( l < r ) {
    m = (l+r)/2;
    ll res = calc(m);
    if( res >= s ) {
      r = m;
    } else {
      l = m+1;
    }
  }
  //printf("%lld %lld\n",l,r);
  ll p = r;
  ll v = calc(r);
  int len = 0;
  //printf("%lld\n",v);
  s -= v;
  char res[222],buf[222];
  int d_=sprintf(buf,"%lld",r);
  while( s <= 0 ) {
    if( p%15 == 0 ) {
      res[len] = "FizzBuzz"[8+s];
    } else if( p%3 == 0 ) {
      res[len] = "Fizz"[3+s];
    } else if( p%5 == 0 ) {
      res[len] = "Buzz"[3+s];
    } else {
      res[len] = buf[d_-len-1];
      //r /= 10;
    }
    ++len;
    ++s;
  }
  if( p%3 != 0 && p%5 != 0 ) {
    reverse(res,res+len);
  }
  ++p;
  while( len < 20 ) {
    r = p;
    if( p%15 == 0 ) {
      for( int i = 0; i < 8; i++ ) {
        res[len++] = "FizzBuzz"[i];
      }
    } else if( p%3 == 0 ) {
      for( int i = 0; i < 4; i++ ) {
        res[len++] = "Fizz"[i];
      }
    } else if( p%5 == 0 ) {
      for( int i = 0; i < 4; i++ ) {
        res[len++] = "Buzz"[i];
      }
    } else {
      int d = sprintf(buf,"%lld",r);
      for( int i = 0; i < d; i++ ) {
        res[len++] = buf[i];
      }
    }
    ++s;
    ++p;
  }
  res[20] = 0;
  //reverse(res,res+20);
  puts(res);
  /*
  printf("%lld\n",fs(10,99));
  printf("%lld\n",fbs(10,99));
  printf("%lld\n",bs(10,99));
  printf(":%lld\n",calc(99));
  printf(":%lld\n",calc(98));
  printf(":%lld\n",calc(97));
  printf(":%lld\n",calc(96));
  printf(":%lld\n",calc(95));
  printf(":%lld\n",calc(100));
  printf(":%lld\n",calc(101));
  printf(":%lld\n",calc(102));
  printf(":%lld\n",calc(1418650793ll));
  printf(":%lld\n",calc(8));
  printf(":%lld\n",calc(1));
  printf(":%lld\n",calc(10));
  printf(":%lld\n",calc(11));
  */
  return 0;
}

Measured memory_bytes: 1044