#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long LL;
int L,R,ans;
int l,r;
int get_f(LL x){
	int res=0;
	for(LL i=x;i;i/=10)res+=i%10;
	return res;
}
void dfs(int x,int num){
	if(x==r+1){
		if(num>=L&&num<=R){
			int k=get_f(num);
			if(get_f((LL)num*num)==k*k)ans++;
		}return;
		
	}
	for(int i=0;i<4;i++)dfs(x+1,num*10+i);
}
int main(){
	freopen("rabbits.in","r",stdin);
	freopen("rabbits.out","w",stdout);
	scanf("%d%d",&L,&R);
	r=log10(R*1.0)+1;
	dfs(1,0);
	printf("%d\n",ans);
	return 0;
}