#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
inline void read(int &x){
	x=0;char ch;bool flag = false;
	while(ch=getchar(),ch<'!');if(ch == '-') ch=getchar(),flag = true;
	while(x=10*x+ch-'0',ch=getchar(),ch>'!');if(flag) x=-x;
}
inline int cat_min(const int &a,const int &b){return a<b ? a:b;}
inline int cat_max(const int &a,const int &b){return a>b ? a:b;}
int f(ll x){
	int ret = 0;
	while(x) ret+=x%10,x/=10;
	return ret;
}
int l,r;
int dfs(int x){
	int ret = 0,tmp;
	for(int i = 0;i <= 3;++i){
		ll y = x*10 + i;
		tmp = f(y);
		if(y == 0 || tmp*tmp != f(y*y)) continue;
		if(l <= y && y <= r) ++ret;
		if(y*10 <= r) ret += dfs(y);
	}return ret;
}
int main(){
	freopen("rabbits.in","r",stdin);
	freopen("rabbits.out","w",stdout);
	read(l);read(r);
	printf("%d\n",dfs(0));
	getchar();getchar();
	fclose(stdin);fclose(stdout);
	return 0;
}