a=input()
b=input()
l=[]
for i in range(len(a)):
if(a[i]==b[i]):
l.append(0)
else:
l.append(1)
print(*l,sep='')#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
string ch1, ch2;
cin>>ch1>>ch2;
int n;
n=sizeof(ch1);
for (size_t i=0 ;i<ch1.size();i++)
if (ch1[i]==ch2[i]){
ch1[i]='0';
}
else {
ch1[i]='1';
}
cout<<ch1;
return 0;
}566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |