#include <iostream>
#include <vector>
#include <queue>
using namespace std;

bool is_palindrome(int x) {
    int tmp = x;
    int rev_num = 0;

    while(tmp > 0) {
        int digit = tmp % 10;
        rev_num = (rev_num * 10) + digit;
        tmp /= 10;
    }

    return (x == rev_num);
}
int main()
{
    vector<int> pals;
    for(int i = 2; i <= 99999; i++) {
        if(is_palindrome(i)) {
            pals.push_back(i);

        }
    }

    int S, E;
    cin >> S >> E;

    vector<bool> visited(100000, false);
    visited[S] = true;

    queue<int> q;
    q.push(S);
    q.push(0);

    while(!q.empty()) {
        int c = q.front(); q.pop();
        int cnt = q.front(); q.pop();

        if(c == E) {
            cout << cnt << endl;
            return 0;
        }

        for(int i = 0; i < (int) pals.size(); i++) {
            if(pals[i] < c and pals[i] + c <= E and !visited[pals[i] + c]) {
                visited[pals[i] + c] = true;
                q.push(pals[i] + c);
                q.push(cnt + 1);
            }

            if(pals[i] >= c) {
                break;
            }
        }
    }
    return 0;
}