Erasing a File for Good

One day Sanggeun's girlfriend called him in a panic.

"Sanggeun, there is a file I have to erase right now. It must never be recoverable."

Erasing a file for good means overwriting that stretch of the hard drive with new data several times.

Sanggeun decided to write a file shredder for her. The program is very simple. The user picks one file to erase and enters $N$, the number of overwrite passes. $N$ has to be a number from 1 to 20. The program overwrites the file bit by bit. On each pass every bit that is 0 becomes 1, and every bit that is 1 becomes 0.

Sanggeun finished the program and now wants to test it. Given the bits that sat where the file was before the erase and the bits sitting there after it, report whether he wrote the program as described.

Whether the file was really erased does not matter here. If Sanggeun wrote the program exactly as described, the deletion succeeded. In every other case it failed.

The first line contains $N$ ($1 \le N \le 20$). The second line contains the bits that were in the file's place before the erase, and the third line contains the bits in that place after it. The bits consist only of 0 and 1, and the two strings have the same length. A bit string is at most 1000 characters long.

On the first line print Deletion succeeded if the deletion succeeded, and Deletion failed if it failed.