Problem: Artsem has a friend Saunders from University of Chicago. Saunders presented him with the following problem.

Let [n] denote the set {1, ..., n}. We will also write f: [x] → [y] when a function f is defined in integer points 1, ..., x, and all its values are integers from 1 to y.

Now then, you are given a function f: [n] → [n]. Your task is to find a positive integer m, and two functions g: [n] → [m], h: [m] → [n], such that g(h(x)) = x for all <image>, and h(g(x)) = f(x) for all <image>, or determine that finding these is impossible.

Input

The first line contains an integer n (1 ≤ n ≤ 105).

The second line contains n space-separated integers — values f(1), ..., f(n) (1 ≤ f(i) ≤ n).

Output

If there is no answer, print one integer -1.

Otherwise, on the first line print the number m (1 ≤ m ≤ 106). On the second line print n numbers g(1), ..., g(n). On the third line print m numbers h(1), ..., h(m).

If there are several correct answers, you may output any of them. It is guaranteed that if a valid answer exists, then there is an answer satisfying the above restrictions.

Examples

Input

3
1 2 3


Output

3
1 2 3
1 2 3


Input

3
2 2 2


Output

1
1 1 1
2


Input

2
2 1


Output

-1

Solution (in PYTHON3):

Solution:
import sys

n = int(input())

f = [int(x) for x in input().split(' ')]

image = set()

h = []

for i, x in enumerate(f):
	if x not in image:
		image.add(x)
		h.append(x)

inv_h = [None for _ in range(n+1)]

for i, x in enumerate(h, 1):
	inv_h[x] = i

for val in h:
	if f[val-1] != val:
		print(-1)
		sys.exit()

print(len(h))

g = [None for _ in range(n)]

for i in range(n):
	g[i] = inv_h[f[i]]

for x in g:
	print(x, end=' ')
print('')

for x in h:
	print(x, end=' ')
print('')