#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
queue<int> q;
int su(ll x) {
	int cnt = 0;
	while(x) cnt += x%10, x /= 10;
	return cnt;
}
int main() {
	freopen("rabbits.in","r",stdin);
	freopen("rabbits.out","w",stdout);
	int l, r, ans = 0; scanf("%d %d", &l, &r);
	q.push(0);
	while(!q.empty()) {
		int p = q.front(); q.pop();
		if(p>r) break;
		if(p>=l) ++ans;
		for(int i=0; i<=3; ++i) {
			if(!p && !i) continue;
			int x = p*10+i, s = su(x);
			if(s*s==su(1LL*x*x)) q.push(x);
			else break;
		}
	}
	printf("%d\n", ans);
	getchar(); getchar();
	return 0;
}