def up(n)
  (10**(n+1) - 10**n) * (n+1) + count_fiz(n, n, 0, 1, 10)
end
def count_fiz(k, n, tmp, s, t)
  top = 10**k*t+tmp-1
  btm = 10**k*s+tmp-1
  a =top/3 -  btm/3 
  b =top/5 -  btm/5
  c =top/15 - btm/15
  (a + b - c) * (3-n) + c * 4
end
def down(n, mod)
  ret = 10**n
  k = n
  while k >= 0
    9.times do
      t = 10**k*(n+1) + count_fiz(k, n, ret, 0, 1)
      if mod < t
        k -= 1
        break
      end
      ret += 10**k
      mod -= t
    end
  end
  [ret,mod]
end
num = gets.to_i - 1
n = 0
while (tmp = up(n)) < num
  n += 1
  num -= tmp
end
p, q = down(n, num)
puts (p..p+20).map{|x|a=[[:Fizz][x%3],[:Buzz][x%5]]*'';a==''?x.to_s: a}.join('')[q,20]