CharSwap
You are given two strings of the same length. Write a program that will say whether the second string can be made from the first one (and the first one made from the second one) by replacing each occurrence of some letter with some other letter (not necessarily different).
InputFrom the first line of the standard input read an integer n - the length of the strings. The next two lines will contain the two strings made of lowercase letters of the English alphabet. n <= 1 000 001.
OutputTo the standard output print "DA" if the second string could be made from the first one as described above. Otherwise print "NE".
Input:
5
jglpt
fhgroOutput:
DASubmit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.