Sengoku still remembers the mysterious "colourful meteoroids" she discovered with Lala-chan when they were little. In particular, one of the nights impressed her deeply, giving her the illusion that all her fancies would be realized.
On that night, Sengoku constructed a permutation p1,p2,...,pn of integers from 1 to n inclusive, with each integer representing a colour, wishing for the colours to see in the coming meteor outburst. Two incredible outbursts then arrived, each with n meteorids, colours of which being integer sequences a1,a2,...,an and b1,b2,...,bn respectively. Meteoroids' colours were also between 1 and n inclusive, and the two sequences were not identical, that is, at least one i (1 \le i \le n) exists, such that ai \neq bi holds.
Well, she almost had it all - each of the sequences a and b matched exactly n-1 elements in Sengoku's permutation. In other words, there is exactly one i (1 \le i \le n) such that ai \neq pi, and exactly one j (1 \le j \le n) such that bj \neq pj.
For now, Sengoku is able to recover the actual colour sequences a and b through astronomical records, but her wishes have been long forgotten. You are to reconstruct any possible permutation Sengoku could have had on that night.
The first line of input contains a positive integer n (2 \le n \le 1000) - the length of Sengoku's permutation, being the length of both meteor outbursts at the same time.
The second line contains n space-separated integers a1,a2,...,an (1 \le ai \le n) - the sequence of colours in the first meteor outburst.
The third line contains n space-separated integers b1,b2,...,bn (1 \le bi \le n) - the sequence of colours in the second meteor outburst. At least one i (1 \le i \le n) exists, such that ai \neq bi holds.
Output n space-separated integers p1,p2,...,pn, denoting a possible permutation Sengoku could have had. If there are more than one possible answer, output any one of them.
Input guarantees that such permutation exists.
5 1 2 3 4 3 1 2 5 4 5\n · · · · \n · · · · \n
1 2 5 4 3· · · · \n
5 4 4 2 3 1 5 4 5 3 1\n · · · · \n · · · · \n
5 4 2 3 1· · · · \n
In the first sample, both 1,2,5,4,3 and 1,2,3,4,5 are acceptable outputs.
In the second sample, 5,4,2,3,1 is the only permutation to satisfy the constraints.