#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5+7, P1 = 31, P2 = 37, mod= 1e9 + 7;
void doWork() {
    ll b;
    cin >> b;
    ll n;
    cin >> n;
    int cnt =0;
    for (int i = 1; i <= 1e6 ; ++i) {
        ll num = 1ll*i*i;
        if ( num > n)
            continue;
        ll rnum = 0,tmp=num;
        while (tmp)
        {
            rnum*=10;
            rnum+=tmp%10;
            tmp/=10;
        }
        ll r= sqrt(rnum);
        if ( r*r == rnum && num%10 && num >= b && num <= n && rnum >= b && rnum <= n)
        {
            cnt++;
        }
    }
    cout << cnt << endl;
}


int main() {
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
//    freopen("bisector.in","r",stdin);
//    freopen("bisector.out","w",stdout);
    int t = 1;
    // cout << primes.size() << endl;
    //cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}