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 *p*_{1}, *p*_{2}, ..., *p*_{n} 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 *a*_{1}, *a*_{2}, ..., *a*_{n} and *b*_{1}, *b*_{2}, ..., *b*_{n} respectively. Meteoroids' colours were also between 1 and *n* inclusive, and the two sequences were not identical, that is, at least one *i* (1 ≤ *i* ≤ *n*) exists, such that *a*_{i} ≠ *b*_{i} 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 ≤ *i* ≤ *n*) such that *a*_{i} ≠ *p*_{i}, and exactly one *j* (1 ≤ *j* ≤ *n*) such that *b*_{j} ≠ *p*_{j}.

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 ≤ *n* ≤ 1 000) — 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 *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ *n*) — the sequence of colours in the first meteor outburst.

The third line contains *n* space-separated integers *b*_{1}, *b*_{2}, ..., *b*_{n} (1 ≤ *b*_{i} ≤ *n*) — the sequence of colours in the second meteor outburst. At least one *i* (1 ≤ *i* ≤ *n*) exists, such that *a*_{i} ≠ *b*_{i} holds.

Output *n* space-separated integers *p*_{1}, *p*_{2}, ..., *p*_{n}, 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.

Input5

1 2 3 4 3

1 2 5 4 5Output1 2 5 4 3Input5

4 4 2 3 1

5 4 5 3 1Output5 4 2 3 1Input4

1 1 3 4

1 4 3 4Output1 2 3 4

提交代码