#include <iostream>
using namespace std;

int main(void){
	int a, b, c=0;
	cin >> a >> b;
	for(int i=a; i<=b; i++){
		if(i/10000==i%10 && (i/1000)%10==(i/10)%10) c++;
	}
	cout << c << endl;
}
### Prompt

Please provide a cpp coded solution to the problem described below:

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

### Response

```cpp
#include <iostream>
using namespace std;

int main(void){
	int a, b, c=0;
	cin >> a >> b;
	for(int i=a; i<=b; i++){
		if(i/10000==i%10 && (i/1000)%10==(i/10)%10) c++;
	}
	cout << c << endl;
}
```