#include<bits/stdc++.h>
using namespace std;

bool huiwen(int a){
	string n = to_string(a);
	int right, left;
	left = 0;
	right = n.size()-1;
	bool x = 1;
	while (left < right){
		if (n[right] != n[left]){
			x = 0;
			break;
		}
		left++,  right--;
	}
	return x;
}
bool runnian(int n){
	if ((n%4 == 0 && n%100 != 0) || n%400 == 0){
		return 1;
	}else{
		return 0;
	}
}
int a, b, ans = 0;
int an, ay, ar;
int bn, by, br;
int yue[13] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
int main(){
	cin >> a >> b;
	an = a/10000, ay = a/100%100, ar = a%100;
	bn = b/10000, by = a/100%100, br = a%100;
	for (int n = an; n <= bn; n++){
		if (runnian(n) == 1){
			yue[2] = 29;
		}else{
			yue[2] = 28;
		}
		for (int y = 1; y <= 12; y++){
			if (n == an && y < ay) continue;
			if (n == bn && y > by) break;
			for (int r = 1; r <= yue[y]; r++){
				if (n == an && y >= ay && r < ar) continue;
				if (n == bn && y <= by && r > br) break;
				int sum = n*10000+y*100+r;
				if (huiwen(sum) == 1) ans++;
			}
		}
	}
	cout << ans;
}