Yash has always been fascinated by puzzles, but he's bored of regular mathematics. One day, while experimenting with patterns on graph paper, he invents a strange "switch math".
In his system, the rules of addition are unlike anything we have seen before:
1. If both positions have the same digit, the result is 0.
2. If the digits are different, the result is 1.
Fascinated, Yash starts calling it “mirror-bit addition” and decides to test it on various binary strings. Your task is to help Yash write a program that can take two such strings and compute their "mirror-bit sum" according to his unusual rules.
Constraints
Input Format
The first line of the input contains an integer 'n' which is the length of the binary strings.
The next two lines each contain a binary string consisting only of 0s and 1s.
Output Format
Output the "mirror-bit sum" in the form of a string.
Example 1
Input:
3
101
010
Output:
111
Explanation:
According to Mirror Bit Addition, sum of different characters gives 1 as a solution and sum of same characters give 0 as a solution.
Therefore -
101
+010
=111
Log In to solve the Question