output_description: Print the maximum possible number of i such that a_i=X.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 .. a_N
attempt: def myAnswer(N:int,A:list) -> int:
     if(N == 1): return 1
     dic ={}
     for a in A:
        if(a == 0):
           for i in range(2):
              if(i in dic.keys()):
                 dic[i]+=1
              else:
                 dic[i]=1
        else:
           for i in range(a-1,a+2):
              if(i in dic.keys()):
                 dic[i]+=1
              else:
                 dic[i] = 1
     return max(list(dic.values()))
  
  def modelAnswer():
     return
  def main():
     N = int(input())
     A = list(map(int,input().split()))
     print(myAnswer(N,A[:]))
  if __name__ =
problem_description: Statement
  
  You are given an integer sequence of length N, a_1,a_2,...,a_N.
  
  For each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or
  do nothing.
  
  After these operations, you select an integer X and count the number of i such
  that a_i=X.
  
  Maximize this count by making optimal choices.
samples: [{"input": "7\n    3 1 4 1 5 9 2", "output": "4\n    \n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4,\nthe maximum possible count.\n\n* * *"}, {"input": "10\n    0 1 2 3 4 5 6 7 8 9", "output": "3\n    \n\n* * *"}, {"input": "1\n    99999", "output": "1"}]