Problem B: Bitset I - Bit Operation I

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $181$ 正确数量 $107$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

Given a non-negative decimal integer xx, convert it to binary representation bb of 32 bits. Then, print the result of the following operations to bb 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

Input

The input is given in the following format.

xx 



Output

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

8
13
00000000000000000000000000001000
11111111111111111111111111110111
00000000000000000000000000010000
00000000000000000000000000000100

00000000000000000000000000001101
11111111111111111111111111110010
00000000000000000000000000011010
00000000000000000000000000000110

Constraints

  • 0x23210≤x≤232−1

Sample Input 1