You are given an integer 'n'. Your task is to perform a sequence of operations:
1)Reverse the digits of 'n'.
2)Square the reversed number.
3)From the squared result, extract only the even digits (0, 2, 4, 6, 8) and print them in the order they appear.
Input Format:
The first line of input contains a single integer 'n'.
Output Format:
Print the even digits found in the final squared number, separated by spaces.
If no even digits are found in the squared result, print nothing (an empty line).
Note:
When reversing the number, any leading zeros that result should be dropped. For example, reversing 120 results in 21, not 021.
The squared number can be large, so ensure you use a data type that can accommodate it (e.g., a 64-bit integer like long in Java or long long in C++).