문제

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.

입력

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.

채점

In test cases worth 40 points in total, it will hold 1 ≤ N ≤ 20.

예제 입력 1

3
abc
abc

예제 출력 1

bca

예제 입력 2

4
baba
baab

예제 출력 2

abba

예제 입력 3

5
aaabc
abcba

예제 출력 3

baaac