#include <bits/stdc++.h> using namespace std; /* ---===ASCII help===--- '0' -> 48 '9' -> 57 'A' -> 65 'Z' -> 90 'a' -> 97 'z' -> 122 */ const long long mod = 1e9 + 7; bool check(string s) { for (long long i = 0; i < s.size(); i++) { if (s[i] != s[s.size() - i - 1]) return false; } return true; } void solve() { long long a, b, ans = 0; cin >> a >> b; for(long long k = a; k <= b; k++){ string s = to_string(k); bool flag = true; long long n = s.size(); for (long long i = 0; i < n; i++) { if (flag) { for (long long j = i + 1; j < n; j++) { if (flag) { string f = ""; for (long long q = i; q <= j; q++) f.push_back(s[q]); if (check(f) && i != j) flag = false; } else break; } } else break; } if (flag) ans++; } cout << ans << "\n"; } int main() { int t = 1; //cin >> t; while (t--) { solve(); } }