Binary Palindrome Checker

Given a binary string composed only of the digits '0' and '1', determine whether the string is a palindrome.

A string \( s \) of length \( n \) is a palindrome if \( s[i] = s[n-i-1] \) for every \( 0 \le i < n/2 \). The solution must check the string in-place without allocating an additional string.

For example, if the input string is '101', the output should be "True", and if the input string is '110', the output should be "False".

inputFormat

The input consists of a single line containing a binary string. The string only contains characters '0' and '1'.

outputFormat

Output a single line containing either "True" if the input string is a binary palindrome or "False" otherwise.

101

True