#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn=1e3+10;
int s1[maxn],s0[maxn];
int main()
{
int n,m;
cin>>n>>m;
ll m1=pow(2,n),m2=pow(2,m);
ll md1,md2;
for(ll i=m1;i>=1;i--)
{
if(i%7==1)
{
md1=i;break;
}
}
for(ll i = m2-1;i>=1;i--)
{
if(i%7==1)
{
md2=i;break;
}
}
ll s1,s2;
s1=(md1)/7+1;
s2=(md2)/7+1;
if(md1==pow(2,n))
cout<<s2-s1+1<<endl;
else
cout<<s2-s1<<endl;
}