格雷码普及题
#include<stdio.h>
typedef long long ll;
ll n;
char s1[65],s2[65];
inline ll ip(char *s)
{
ll rt=0;
for (int i=1;i<=n;i++) if (s[i]=='1') rt+=1LL<<n-i;
return rt;
}
inline ll bin(ll x)
{
ll rt=x;
while (x>>=1) rt^=x;
return rt;
}
int main()
{
scanf("%lld%s%s",&n,s1+1,s2+1);
printf("%lld",bin(ip(s2))-bin(ip(s1))-1);
}