# your code goes here
import sys
a={}
def ways(p,q):
if a.has_key((p,q)):
return a[p,q]
if p==0 or q==0:
return 0
elif p==1:
return q*(q-1)
elif q==1:
return p*(p-1)
else:
a[(p-1,q)]=ways(p-1,q)
if not a.has_key((p,q-1)):
a[(p,q-1)]=ways(p,q-1)
if not a.has_key((p-1,q-1)):
a[(p-1,q-1)]=ways(p-1,q-1)
return 4*min(p-1,q-1)+2*(p-1+q-1)+ways(p-1,q)+ways(p,q-1)-ways(p-1,q-1)
print ways(100,223)
IyB5b3VyIGNvZGUgZ29lcyBoZXJlCmltcG9ydCBzeXMKYT17fQpkZWYgd2F5cyhwLHEpOgoJaWYgYS5oYXNfa2V5KChwLHEpKToKCQlyZXR1cm4gYVtwLHFdCglpZiBwPT0wIG9yIHE9PTA6CgkJcmV0dXJuIDAKCWVsaWYgcD09MToKCQlyZXR1cm4gcSoocS0xKQoJZWxpZiBxPT0xOgoJCXJldHVybiBwKihwLTEpCgllbHNlOgoJCWFbKHAtMSxxKV09d2F5cyhwLTEscSkKCQlpZiBub3QgYS5oYXNfa2V5KChwLHEtMSkpOgoJCQlhWyhwLHEtMSldPXdheXMocCxxLTEpCgkJaWYgbm90IGEuaGFzX2tleSgocC0xLHEtMSkpOgoJCQlhWyhwLTEscS0xKV09d2F5cyhwLTEscS0xKQoJCXJldHVybiA0Km1pbihwLTEscS0xKSsyKihwLTErcS0xKSt3YXlzKHAtMSxxKSt3YXlzKHAscS0xKS13YXlzKHAtMSxxLTEpCnByaW50IHdheXMoMTAwLDIyMyk=