#C7915. Taco FizzBuzz Challenge

    ID: 51839 Type: Default 1000ms 256MiB

Taco FizzBuzz Challenge

Taco FizzBuzz Challenge

Your task is to implement a variant of the classic FizzBuzz problem.

Given an integer \(m\), you need to follow these steps:

  • If \(m\) is divisible by both \(3\) and \(5\), output FizzBuzz.
  • If \(m\) is divisible by \(3\) only, output Fizz.
  • If \(m\) is divisible by \(5\) only, output Buzz.
  • If \(m\) is not divisible by either \(3\) or \(5\), output the number \(m\) as a string.

For example:

Input: 3
Output: Fizz

Input: 10 Output: Buzz

Input: 15 Output: FizzBuzz

Input: 7 Output: 7

</p>

Make sure your solution reads from standard input (stdin) and writes to standard output (stdout).

inputFormat

The input consists of a single integer \(m\) provided via standard input.

outputFormat

Output a single string according to the following conditions:

  • If \(m\) is divisible by both \(3\) and \(5\), print FizzBuzz.
  • If \(m\) is divisible by \(3\) only, print Fizz.
  • If \(m\) is divisible by \(5\) only, print Buzz.
  • If none of the above conditions are met, print \(m\) as a string.
## sample
3
Fizz