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>
#include <algorithm>
#include <math.h>
#include <string>
#include <stack>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;

void printarray(int n, int a[])
{
    for (int i = 0; i < n; i++)
    {
        cout << a[i];
        /*if (i != n - 1)
            cout << " ";*/
    }
    cout << endl;
}

void printpairaraay(int n, pair<int, int> a[])
{
    int x, y;
    for (int i = 0; i < n; i++)
    {
        x = a[i].first;
        y = a[i].second;
        cout << x << " " << y << "\n";
    }
    cout << endl;
}

void swaprange(int b, int t, int e, int a[])
{
    for (int i = 0; i < e - b; i++)
    {
        swap(a[b + i], a[i + t]);
    }
}

int my_binarysearch(int n, int a[], int x)
{
    int ret = 0;
    if (distance(lower_bound(a, a + n, x), upper_bound(a, a + n, x)) != 0)
        ret = 1;
    return ret;
}

void printbit(unsigned int x)
{
    unsigned int b, y;
    
    b = 32;
    int a[b];
    y = pow(2, 31);
    cin >> x;

    for (int i = 0; i < b; i++)
    {
        if (x >= y)
        {
            a[i] = 1;
            x -= y;
        }
        else
            a[i] = 0;

        y = y >> 1;
    }
    printarray(b, a);
}

int main()
{	
  	const unsigned int max = 4294967295;
  	unsigned int x, y, z, w;
   	cin >> x;
	printbit(x);
  	w = x ^ 4294967295;
  	printbit(w);
  	y = x << 1;
 	printbit(y);
	z = x >> 1;
 	printbit(z);
    return 0;
}

// getline(cin,s);
// a = strtok(s, ",");  ","で分解
// for (int i = 0; i < n; i++)
