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.

* Inversion: change the state of each bit to the opposite state
* Logical left shift: shift left by 1
* Logical right shift: shift right by 1

Constraints

* $0 \leq x \leq 2^{32} - 1$

Input

The input is given in the following format.


$x$


Output

Print the given bits, results of inversion, left shift and right shift in a line respectively.

Examples

Input

8


Output

00000000000000000000000000001000
11111111111111111111111111110111
00000000000000000000000000010000
00000000000000000000000000000100


Input

13


Output

00000000000000000000000000001101
11111111111111111111111111110010
00000000000000000000000000011010
00000000000000000000000000000110
import java.util.*;

class Main{
	static final int nbits = 32;
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		long x = sc.nextLong();
		BitSet bs = new BitSet(nbits);
		for(int i = 0; i < nbits; i++){
			if((x & (1 << i)) != 0) bs.set(i);
		}
		printBitSet(bs);
		System.out.print("\n");
		bs.flip(0, nbits);
		printBitSet(bs);
		System.out.print("\n");
		bs.flip(0, nbits);
		BitSet bsa = new BitSet(nbits);
		for(int i = 0; i < nbits - 1; i++){
			if(bs.get(i)) bsa.set(i + 1);
		}
		printBitSet(bsa);
		System.out.print("\n");
		bsa = new BitSet(nbits);
		for(int i = 0; i < nbits - 1; i++){
			if(bs.get(i + 1)) bsa.set(i);
		}
		printBitSet(bsa);
		System.out.print("\n");
	}
	static void printBitSet(BitSet bs){
		for(int i = nbits - 1; i >= 0; i--){
			if(bs.get(i)) System.out.print(1);
			else System.out.print(0);
		}
	}
}

