output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: def left(text, n):
    return text[:n]
  
  def right(text, n):
    return text[-n:]
  
  def mid(text, n, m):
    return text[n-1:n+m-1]
    
  n = int(input())
  
  rangeSet = [[0]*10 for i in range(10)]
  
  # [1,9][9,1]など先頭＋最終の組み合わせを設定
  for i in range(1,n+1):
  	first = int(left(str(i),1))
  	end = int(right(str(i),1))
  	rangeSet[first][end] += 1
  
      kumiawase = 0
  for k in range(1,10):
  	for l in range(1,10):
  		tmp = rangeSet[k][l] * rangeSet[l][k]
  		kumiawase += tmp	
  print(kumiawase)
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"}]