#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstdlib>

#include <cstring>

#define in(a) a=read()

#define REP(i,k,n)  for(int i=k;i<=n;i++)

using namespace std;

inline int read(){

    int x=,f=;

    char ch=getchar();

    for(;!isdigit(ch);ch=getchar())

        if(ch=='-')

            f=-;

    for(;isdigit(ch);ch=getchar())

        x=x*+ch-'';

    return x*f;

}

int a,b,digit[],dp[][],ind;

inline int dfs(int pos,int state,bool ze,bool flag){

    if(!pos)  return ;

    if(!ze && dp[pos][state] && !flag)  return dp[pos][state];

    int up,ans=;

    if(flag)  up=digit[pos];

    else  up=;

    REP(i,,up){

        if(abs(i-state)<)  continue;

        if(ze && !i)  ans+=dfs(pos-,-,,flag && i==digit[pos]);

        else  ans+=dfs(pos-,i,,flag && i==digit[pos]);

    }

    if(!flag && !ze)  dp[pos][state]=ans;

    return ans;

}

inline int solve(int x){

    ind=;

    while(x){

        digit[++ind]=x%;

        x/=;

    }

    memset(dp,,sizeof(dp));

    return dfs(ind,-,,);

}

int main(){

    in(a),in(b);

    printf("%d",solve(b)-solve(a-));

}