1 \(s / 64\) \(MB / 100\) points

Mirko and Slavko are bored on their skiing trip, so they came up with an interesting game

they could play. First, Mirko specifies a number \(N\)

. Then Slavko writes \(N\) letters he will use to

create his word. Then Mirko writes a word consisting of \(N\) letters. Slavko’s goal is to create a

word using the letters he chose, but so that not a single letter in his word matches the letter

at the same position in Mirko’s word. In order to make the game even more intense, Slavko

must find the lexicographically smallest such word. This word will surely exist . Since Mirko

and Slavko are still young, they know only 3 letters: a, b, and c, which greatly affects their

programming skills.

In test cases worth 40 points in total, it will hold 1 ≤ \(N\)

≤ 20.

The first line of input contains the positive integer N (1

≤ \(N\)

≤ 5000).
The following line contains a string of \(N\)

lowercase letters ‘a’, ‘b’, or ‘c’, the letters Slavko
chose.
The third line contains a string of \(N\)

lowercase letters ‘a’, ‘b’, or ‘c’, the word Mirko wrote.

The first and only line of output must contain the word Slavko found.

생성자가 기록되지 않았습니다.

출처 COCI 2016/2017 Contest 7