#K37107. Fusion Number Checker

    ID: 25903 Type: Default 1000ms 256MiB

Fusion Number Checker

Fusion Number Checker

A positive integer n is given. A number is called a Fusion Number if it has an even number of digits and the sum of the first half of the digits is equal to the sum of the second half. Otherwise, the number is not a Fusion Number. Note that numbers with an odd number of digits automatically are classified as Not Fusion.

For example, consider the number \(123231\): it has 6 digits. The sum of the first three digits is \(1+2+3=6\) and the sum of the last three digits is \(2+3+1=6\), so it is a Fusion Number.

Your task is to determine whether the given number is a Fusion Number. The input will be read from standard input (stdin) and the output should be written to standard output (stdout).

inputFormat

The input consists of a single line containing a non-negative integer represented as a string. The integer may have leading zeros, and its length can be arbitrarily large. Note that if the number has an odd number of digits, it is automatically considered as not a Fusion Number.

outputFormat

Print either "Fusion" if the given number is a Fusion Number, or "Not Fusion" otherwise.## sample

123231
Fusion