CF297C Splitting the Uniqueness

Polar bears like unique arrays — that is, arrays without repeated elements. You have got a unique array $ s $ with length $ n $ containing non-negative integers. Since you are good friends with Alice and Bob, you decide to split the array in two. Precisely, you need to construct two arrays $ a $ and $ b $ that are also of length $ n $ , with the following conditions for all $ i $ $ (1

The first line of the input contains integer $ n $ $ (1

If it is possible to make Alice and Bob happy (if you can split the given array), print "YES" (without quotes) in the first line. In the second line, print the array $ a $ . In the third line, print the array $ b $ . There may be more than one solution. Any of them will be accepted. If it is impossible to split $ s $ into almost unique arrays $ a $ and $ b $ , print "NO" (without quotes) in the first line.

In the sample, we can remove the first two entries from $ a $ and the second entry from $ b $ to make them both unique.