Find the number of palindromic numbers among the integers between A and B (inclusive). Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.

Constraints

* 10000 \leq A \leq B \leq 99999
* All input values are integers.

Input

Input is given from Standard Input in the following format:


A B


Output

Print the number of palindromic numbers among the integers between A and B (inclusive).

Examples

Input

11009 11332


Output

4


Input

31415 92653


Output

612
#include <bits/stdc++.h>
using namespace std;
 
int main() {
  int A,B;
  cin >> A >> B;
  int N=0;
  for(int i=A/100;i<=B/100;i++){
    int tmp=i*100+(i%100/10)*10+(i/100);
    if(A<=tmp&&tmp<=B)N++;
  }
  cout<<N<<endl;
}