Given a non-negative decimal integer $x$, convert it to binary representation $b$ of 32 bits. Then, print the result of the following operations to $b$ respecitvely.
The input is given in the following format.
$x$
Print the given bits, results of inversion, left shift and right shift in a line respectively.
8
00000000000000000000000000001000 11111111111111111111111111110111 00000000000000000000000000010000 00000000000000000000000000000100
13
00000000000000000000000000001101 11111111111111111111111111110010 00000000000000000000000000011010 00000000000000000000000000000110