output_description: Print the number of _palindromic numbers_ among the integers between A and B
  (inclusive).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: # -*- coding:utf-8 -*-
  
  if __name__ == "__main__":
      A, B = list(map(int, input().split()))
      ans = 0
      for i in range(A, B+1)
          c = str(i)
          if len(c)%2 == 0:
              continue
          J = len(c)
          for j in range(J):
              if c[j] == c[J-1-j]:
                  if j == J-1-j:
                      ans += 1
                      break
              else:
                  break
          print(ans)
  
problem_description: 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.
samples: [{"input": "11009 11332", "output": "4\n    \n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and\n11311.\n\n* * *"}, {"input": "31415 92653", "output": "612"}]