#就是最原始的方法
def add_ser(n):
sig_n = []
for s in n:
if s.isdigit() and int(s) != 9:
sig_n.append(str(int(s)+1))
elif s.isdigit() and int(s) == 9:
sig_n.append('0')
elif s.islower() and s != 'z':
sig_n.append(chr(ord(s.upper())+1))
elif s.islower() and s == 'z':
sig_n.append('A')
elif s.isupper() and s != 'Z':
sig_n.append(chr(ord(s.lower())+1))
elif s.isupper() and s == 'Z':
sig_n.append('a')
else:
sig_n.append(s)
return ''.join(sig_n)
# 解密
def solve_ser(m):
sig_n = []
for s in m:
if s.isdigit() and int(s) != 0:
sig_n.append(str(int(s) - 1))
elif s.isdigit() and int(s) == 0:
sig_n.append('9')
elif s.islower() and s != 'a':
sig_n.append(chr(ord(s.upper()) - 1))
elif s.islower() and s == 'a':
sig_n.append('Z')
elif s.isupper() and s != 'A':
sig_n.append(chr(ord(s.lower()) - 1))
elif s.isupper() and s == 'A':
sig_n.append('z')
else:
sig_n.append(s)
return ''.join(sig_n)
n = input().strip()
m = input().strip()
print(add_ser(n))
print(solve_ser(m))