005. Fizz Buzz

005. Fizz Buzz

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Take in a number from 1 through 1000, print Fizz if the number is divisible by 3, print Buzz if the number is divisible by 5, or FizzBuzzif the number is divisible by both. If none of these conditions are true, print nothing

Input

The only line of input contains a single positive integer N between 1 and 1000 inclusively

Output

Fizz, Buzz, FizzBuzz, or nothing

Examples

input

Copy

1

output

Copy

input

Copy

3

output

Copy

Fizz

input

Copy

5

output

Copy

Buzz

input

Copy

15

output

Copy

FizzBuzz