#include <bits/stdc++.h> using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<to;x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- string decdec(string A) { reverse(A.begin(),A.end()); FORR(r,A) { if(r--!='0') break; r='9'; } if(A.back()=='0') A.resize(A.size()-1); reverse(A.begin(),A.end()); return A; } string A,B; ll p10[20]; ll memo[20][2][2]; ll dp(int d,string &s, int lead,int one) { if(d>=s.size()) return 0; if(memo[d][lead][one]>=0) return memo[d][lead][one]; ll ret=0; int i; if(lead) { FOR(i,s[d]-'0') { if(i==2 && one) ret += p10[s.size()-1-d]; if(i==1) ret += dp(d+1,s,0,1); else ret += dp(d+1,s,0,0); } if(s[d]=='2' && one) ret += atoll(s.substr(d+1).c_str())+1; ret += dp(d+1,s,1,(s[d]=='1')); } else { FOR(i,10) { if(i==2 && one) ret += p10[s.size()-1-d]; if(i==1) ret += dp(d+1,s,0,1); else ret += dp(d+1,s,0,0); } } return memo[d][lead][one]=ret; } ll inc(string s) { if(s.size()<=1) return 0; if(s.size()==2) return s>="12"; MINUS(memo); return dp(0,s,1,0); } ll con(string a) { if(a.size()<2) return a[0]>='2'; int low=(a.back()-'0'); a.pop_back(); if(low<2) a=decdec(a); ll ret=1; int i; FOR(i,a.size()) { if(i || a[0]>'2') { ret += p10[a.size()-1-i]; } else if(a[i]=='2') { string b=a.substr(1); ret += atoll(b.c_str())+1; } } return ret; } void solve() { int i,j,k,l,r,x,y; string s; p10[0]=1; FOR(i,18) p10[i+1]=p10[i]*10; cin>>A>>B; int c=(A=="2" || (A.size()>1 && A.back()=='2' && A[0]=='2')); A=decdec(A); cout<<(inc(B)+con(B)-inc(A)-con(A)-c)<<endl; } int main(int argc,char** argv){ string s;int i; if(argc==1) ios::sync_with_stdio(false); FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin); solve(); return 0; }