# include "iostream"
# include "cstdio"
# include "cmath" 

using namespace std;

int n; 

void Dfs(int n){
	if(n==0) return;
	int now=n%2;
	if(now) n--; 
	Dfs(n/(-2)); 
	printf("%d",abs(now)); 
	return; 
}

int main(){
	scanf("%d",&n); 
	if(n==0){
		printf("0"); 
	}else{
		Dfs(n); 
	}
	return 0; 
}
### Prompt

Construct a Cpp code solution to the problem outlined:

Given an integer N, find the base -2 representation of N.

Here, S is the base -2 representation of N when the following are all satisfied:

* S is a string consisting of `0` and `1`.
* Unless S = `0`, the initial character of S is `1`.
* Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N.



It can be proved that, for any integer M, the base -2 representation of M is uniquely determined.

Constraints

* Every value in input is integer.
* -10^9 \leq N \leq 10^9

Input

Input is given from Standard Input in the following format:


N


Output

Print the base -2 representation of N.

Examples

Input

-9


Output

1011


Input

123456789


Output

11000101011001101110100010101


Input

0


Output

0

### Response

```cpp
# include "iostream"
# include "cstdio"
# include "cmath" 

using namespace std;

int n; 

void Dfs(int n){
	if(n==0) return;
	int now=n%2;
	if(now) n--; 
	Dfs(n/(-2)); 
	printf("%d",abs(now)); 
	return; 
}

int main(){
	scanf("%d",&n); 
	if(n==0){
		printf("0"); 
	}else{
		Dfs(n); 
	}
	return 0; 
}
```