/*=========================================*
  * Auther: Riolu
  * Time: 2016.11.8
  * ©Copyright 2016 Riolu. All Rights Reserved.
  *=========================================*/

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
#include<string>
#include<ctime>
#include<cstring>
using namespace std;


typedef long long ll;
typedef double db;
typedef pair<int,int> P;
const int N =2e5+2;
int l,r,ans;


ll s(ll x){
	ll y=x,tans=0;
	while(y){
		tans+= (y%10);
		y/=10;
	}
	return tans;
}

void dfs(ll y){
	if(y>r) return;
	if(y>=l && s(y)*s(y)==s(y*y)){ans++;}
	if(y)dfs(y*10);
	for(int i=1;i<4;i++)dfs(y*10+i);
}

int main(){
	
	freopen("rabbits.in","r",stdin);
	freopen("rabbits.out","w",stdout);
	int num=0;

	cin>>l>>r;
	dfs(0);
	cout<<ans<<endl;
	return 0;
}
/*

*/