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
#include<iostream>
using namespace std;

void print( int* a );
void reverse( int* a );
void shiftL( int* a );
void shiftR( int* a );

int main()
{
    long long x;                    //整数の範囲を間違えない
    int bit[32];

    for( int i = 0; i < 32; i++ )
        bit[i] = 0;

    cin >> x;

    int j = 0;
    while( x > 1 )
    {
        bit[j] = x % 2;
        j++;
        x = x / 2;
    }

    bit[j] = x;                     //最後のbitを入れる(1)

    print( bit );
    reverse( bit );
    shiftL( bit );
    shiftR( bit );

    return 0;
}

void print( int* a )
{
    for( int i = 0; i < 32; i++ )
        cout << a[31-i];
    cout << endl;
}

void reverse( int* a )
{
    int x[32];
    for( int i = 0; i < 32; i++ )
    {
        if( a[i] == 1 )
            x[i] = 0;
        else
            x[i] = 1;
    }
    print( x );
}

void shiftL( int* a )
{
    int x[32];
    x[0] = 0;
    for( int i = 0; i < 31; i++ )
        x[i+1] = a[i];
    print( x );
}

void shiftR( int* a )
{
    int x[32];
    x[31] = 0;
    for( int i = 0; i < 31; i++ )
        x[i] = a[i+1];
    print( x );
}
