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

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ld long double
#define el "\n"
#define matrix vector<vector<int>>
#define pt complex<ld>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<ll, null_type,less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
const ll N = 1e5 + 5, LOG = 20, INF = 1e18;
const ld pi = acos(-1);
const ll mod = 1e9 + 7;
const ld eps = 1e-12;
int dx[] = {0, 1, 0, -1, -1, 1, -1, 1};
int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
ll n, m, x, y, k;

void dowork() {
    cin >> x >> y;
    ll ans = 0, num, tmp;
    string s;
    set<ll>st;
    for (ll i = 1; i * i <= y; i++) {
        num = i * i;
        s = to_string(num);
        reverse(s.begin(), s.end());
        num = stoll(s);
        tmp = sqrt(num);
        if (tmp * tmp == num && num <= y && num >= x && i * i >= x && i * i <= y && s[0] != '0') {
            st.insert(num);
            //cout << num << el;
        }
    }
    cout << st.size() << el;
}

signed main() {
    fast
    //freopen("lis.in", "r", stdin);
    //freopen("bitwise.out", "w", stdout);
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        dowork();
    }
    return 0;
}