E. Two Small Stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two strings s and t both of length 2 and both consisting only of characters 'a', 'b' and 'c'.Possible examples of strings s and t: "ab", "ca", "bb".You have to find a string res consisting of 3n characters, n characters should be 'a', n characters should be 'b' and n characters should be 'c' and s and t should not occur in res as substrings.A substring of a string is a contiguous subsequence of that string. So, the strings "ab", "ac" and "cc" are substrings of the string "abacc", but the strings "bc", "aa" and "cb" are not substrings of the string "abacc".If there are multiple answers, you can print any of them.InputThe first line of the input contains one integer n (1 \le n \le 10^5) — the number of characters 'a', 'b' and 'c' in the resulting string.The second line of the input contains one string s of length 2 consisting of characters 'a', 'b' and 'c'.The third line of the input contains one string t of length 2 consisting of characters 'a', 'b' and 'c'.OutputIf it is impossible to find the suitable string, print "NO" on the first line. Otherwise print "YES" on the first line and string res on the second line. res should consist of 3n characters, n characters should be 'a', n characters should be 'b' and n characters should be 'c' and s and t should not occur in res as substrings.If there are multiple answers, you can print any of them.ExamplesInput
2
ab
bc
Output
YES
acbbac
Input
3
aa
bc
Output
YES
cacbacbab
Input
1
cb
ac
Output
YES
abc

2
ab
bc

YES acbbac 
['brute force', 'constructive algorithms', '*1900']