#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=2e4+5,U=1e9;
int a[N],b[N];

int main()
{
	//freopen("1.in","r",stdin);
	int n;
	cin>>n;
	rep(i,1,n)
	{
		int p;
		scanf("%d",&p);
		a[p]+=i;
		b[p+1]-=i;
	}
	rep(i,1,n){a[i]+=a[i-1];b[i]+=b[i-1];}
	rep(i,1,n)printf("%d\n",1+a[i]);
	rep(i,1,n)printf("%d\n",U+b[i]);
}
### Prompt

Construct a Cpp code solution to the problem outlined:

You are given a permutation p of the set {1, 2, ..., N}. Please construct two sequences of positive integers a_1, a_2, ..., a_N and b_1, b_2, ..., b_N satisfying the following conditions:

* 1 \leq a_i, b_i \leq 10^9 for all i
* a_1 < a_2 < ... < a_N
* b_1 > b_2 > ... > b_N
* a_{p_1}+b_{p_1} < a_{p_2}+b_{p_2} < ... < a_{p_N}+b_{p_N}

Constraints

* 2 \leq N \leq 20,000
* p is a permutation of the set {1, 2, ..., N}

Input

The input is given from Standard Input in the following format:


N
p_1 p_2 ... p_N


Output

The output consists of two lines. The first line contains a_1, a_2, ..., a_N seperated by a space. The second line contains b_1, b_2, ..., b_N seperated by a space.

It can be shown that there always exists a solution for any input satisfying the constraints.

Examples

Input

2
1 2


Output

1 4
5 4


Input

3
3 2 1


Output

1 2 3
5 3 1


Input

3
2 3 1


Output

5 10 100
100 10 1

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=2e4+5,U=1e9;
int a[N],b[N];

int main()
{
	//freopen("1.in","r",stdin);
	int n;
	cin>>n;
	rep(i,1,n)
	{
		int p;
		scanf("%d",&p);
		a[p]+=i;
		b[p+1]-=i;
	}
	rep(i,1,n){a[i]+=a[i-1];b[i]+=b[i-1];}
	rep(i,1,n)printf("%d\n",1+a[i]);
	rep(i,1,n)printf("%d\n",U+b[i]);
}
```