output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: N = int(input())
  
  # N以下で先頭と末尾がkのやつ
  TTS = [1, 1, 10, 100, 1000, 10000, 100000]
  TTW = [0, 1, 10, 100, 1000, 10000, 100000]
  
  
  def ttk(N, k):
      c = 0
      Nd = len(str(N))
      # print("Nd",Nd)
      for i in range(Nd - 1):
          # print(TTS[i])
          c += TTS[i]
      if Nd >= 3:
          for i in range(10 ** (Nd - 2)):
              a = int(str(k) + (Nd - 2 - len(str(i))) * "0" + str(i) + str(k))
              # print("a=",a)
              if a <= N:
                  c += 1
              else:
                  break
      elif Nd == 2:
          a = int(str(k) * 2)
          if a <= N:
              c += 1
      elif Nd == 1:
          a = k
          if a <= N:
              c += 1
      return c
  
  
  # (i)先頭末尾が同じもの
  """
  y = 0
  for i in range(1,10):
      y += ttk(N,i)**2
  print(y)
  """
  
  
  def ttpq(N, p, q):
      c = 0
      Nd = len(str(N))
      # print("Nd",Nd)
      for i in range(Nd - 1):
          # print(TTW[i])
          c += TTW[i]
      if Nd >= 3:
          for i in range(10 ** (Nd - 2)):
              a = int(str(p) + (Nd - 2 - len(str(i))) * "0" + str(i) + str(q))
              # print(a)
              if a <= N:
                  c += 1
              else:
                  break
      elif Nd == 2:
          a = int(str(p) + str(q))
          if a <= N:
              c += 1
      elif Nd == 1:
          c = 0
      return c
  
  
  # (ii)先頭末尾が違うもの
  
  y = 0
  for i in range(1, 10):
      for j in range(i, 10):
          # print("i:{},j,{}".format(i,j))
          if i == j:
              # print("   added",ttk(N,i)**2)
              y += ttk(N, i) ** 2
          else:
              # print("   added",ttpq(N,i,j)**2)
              y += ttpq(N, i, j) * ttpq(N, j, i) * 2
          # print(y)
  print(y)
  
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"}]