output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: n = int(input())
  x = n // 10
  basenum = x * x + 8
  addnum = 0
  # print("{0} {1}".format(x* 10 + 1, n))
  hassame = False
  for i in range(x * 10 + 1, n + 1):
      # print(i)
      for j in range(1, n + 1):
          # print(j)
          if str(i)[0] == str(j)[-1] and str(i)[-1] == str(j)[0]:
              addnum += 1
              if i == j:
                  hassame = True
              # print("{0},{1}".format(i, j))
  res = basenum + addnum * 2
  if hassame:
      res -= 1
  # print("n={0}, x={1}, basenum={2}, addnum={3} res ={4}".format(n,x,basenum,addnum,res))
  print(res)
  
problem_description: Statement
  
  Given is a positive integer N.  
  Find the number of pairs (A, B) of positive integers not greater than N that
  satisfy the following condition:
  
    * When A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.
samples: [{"input": "25", "output": "17\n    \n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22),\n(3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21),\n(21,12), (22,2), and (22,22).\n\n* * *"}, {"input": "1", "output": "1\n    \n\n* * *"}, {"input": "100", "output": "108\n    \n\n* * *"}, {"input": "2020", "output": "40812\n    \n\n* * *"}, {"input": "200000", "output": "400000008"}]