Write a program that simulates an XOR operation. The input should be a word representing a binary number (0s and 1s). The program should XOR all the digits from left to right and output the results as "True" or "False." In an XOR operation, a XOR b is true if a or b is true but not both; otherwise, it is false. In this program, the character "1" will represent true and a "0" will represent false. For example, if the input is 1011, then the output will be 1. You can assume that the input word is guaranteed to contain only 0s and 1s.