FizzBuzz Variant

For the integers 1..N in increasing order, output one line per integer: FizzBuzz if it is divisible by both 3 and 5; Fizz if it is divisible only by 3; Buzz if it is divisible only by 5; otherwise the integer itself.

输入格式

The input is a single integer N. The complete original bound from the OCR and Fastprep is 0<N<2×10^6, i.e. 1≤N≤1999999; it must not be miswritten as ≤2000000.

输出格式

Output N lines, with the exact capitalization Fizz, Buzz, FizzBuzz; a newline after the last line is allowed.

样例 1

输入：

5

输出：

1
2
Fizz
4
Buzz

样例 2

输入：

15

输出：

1
2
Fizz
4
Buzz
Fizz
7
8
Fizz
Buzz
11
Fizz
13
14
FizzBuzz

样例 3

输入：

1

输出：

1

样例说明

The outputs of the three public examples are, in order: 1 / 2 / Fizz / 4 / Buzz; 1 / 2 / Fizz / 4 / Buzz / Fizz / 7 / 8 / Fizz / Buzz / 11 / Fizz / 13 / 14 / FizzBuzz; 1. Verified by independent enumeration or direct simulation.