import std.stdio, std.string, std.conv, std.math, std.algorithm, std.range;

// indexから始めるstringのstartIndexを返す
ulong calculateIndex( ulong index ) {
  index--;
  ulong sum = 0;
  ulong sumNumDiv3 = 0;
  ulong sumNumDiv5 = 0;
  ulong sumNumDiv15 = 0;
  ulong digit = 1;
  while ( 10 ^^ digit < index ) {
	immutable ulong ulim = ( 10 ^^ digit ) - 1;
	immutable ulong numDiv3 = ulim / 3 - sumNumDiv3;
	immutable ulong numDiv5 = ulim / 5 - sumNumDiv5;
	immutable ulong numDiv15 = ulim / 15 - sumNumDiv15;
	immutable ulong rest = ulim - ( 10 ^^ ( digit - 1 ) - 1 ) - numDiv3 - numDiv5 + numDiv15;
	sum += ( numDiv3 + numDiv5 ) * 4 + rest * digit;
	sumNumDiv3 += numDiv3;
	sumNumDiv5 += numDiv5;
	sumNumDiv15 += numDiv15;
	digit++;
  }
  immutable ulong numDiv3 = index / 3 - sumNumDiv3;
  immutable ulong numDiv5 = index / 5 - sumNumDiv5;
  immutable ulong numDiv15 = index / 15 - sumNumDiv15;
  immutable ulong rest = index - ( 10 ^^ ( digit - 1 ) - 1 ) - numDiv3 - numDiv5 + numDiv15;
  sum += ( numDiv3 + numDiv5 ) * 4 + rest * digit;
  return sum + 1;
}

ulong binarySearch( immutable ulong n ) {
  ulong left = 0;
  ulong right = 10UL ^^ 18;
  while ( right > left + 1 ) {
	immutable ulong middle = ( left + right ) / 2;
	immutable ulong val = calculateIndex( middle );
	if ( val < n ) {
	  left = middle;
	} else if ( val > n ) {
	  right = middle;
	} else {
	  return middle;
	}
  }
  if ( calculateIndex( left + 1 ) <= n ) {
	left++;
  }
  return left;
}

ulong calculateDigit( ulong n ) {
  return convert( n ).length;
}

string convert( ulong n ) {
  if ( n % 15 == 0 ) return "FizzBuzz";
  else if ( n % 3 == 0 ) return "Fizz";
  else if ( n % 5 == 0 ) return "Buzz";
  else return to!string( n );
}

void main()
{
  immutable ulong n = to!ulong( strip( readln ) );
  solve( n );
}

void solve( ulong n ) {
  ulong index = binarySearch( n );
  ulong startIndex = n - calculateIndex( index );
  ulong sum = calculateDigit( index ) - startIndex;
  write( convert( index )[ startIndex .. $ ] );
  index++;
  
  while ( sum < 20UL ) {
	ulong endIndex = min( calculateDigit( index ), 20UL - sum );
	write( convert( index )[ 0 .. endIndex ] );
	index++;
	sum += endIndex;
  }
  writeln();
}