Pronic Number Checker

A pronic number (or oblong number) is the product of two consecutive integers. In other words, a number \(N\) is pronic if there exists an integer \(n\) such that \(N = n(n+1)\).

Your task is to determine whether a given integer \(X\) is a pronic number. If it is pronic, output 1; otherwise, output 0.

The formula for a pronic number is: \(n(n+1)\), where \(n \ge 0\).

inputFormat

The input consists of a single integer \(X\) given via standard input (stdin).

outputFormat

Output 1 if the integer is a pronic number, otherwise output 0. The result should be written to standard output (stdout).

12

1