Problem:
Score : 200 points

Problem Statement

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).

Sample Input 1

11009 11332

Sample Output 1

4

There are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.

Sample Input 2

31415 92653

Sample Output 2

612

Solution in Fortran (gfortran v4.8.4) (judge verdict: Accepted)

implicit none
integer :: a,b
integer :: n,i,j,k,nstr
character(5) :: str
logical :: flg

read *,a,b

n = 0
do i = a, b
   write(str,'(i0)') i
   flg = .true.
   nstr = len_trim(str)
   k = nstr+1
   do j = 1, nstr/2
      k = k - 1
      if (str(j:j) .ne. str(k:k)) then
         flg = .false.
         exit
      endif
   enddo
   if (flg) then
      n = n + 1
   endif
enddo

write(6,'(i0)') n
stop
end