output_description: Print \sum_{i=1}^{N-1}\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 \ldots A_N
attempt: S = input()
  T = input()
  print(S)
  print(T)
  num = []
  for i in range(len(T)):
      _T = T[i:]
      for j in range(len(T) - i):
          _T_ = _T if j == 0 else _T[:-j]
          base = S[i:-j] if j != 0 else S[i:]
          if _T_ in base:
              num.append(len(T) - len(_T_))
  print(num)
  print(min(num))
  
problem_description: Statement
  
  Given are N integers A_1,\ldots,A_N.
  
  Find the sum of A_i \times A_j over all pairs (i,j) such that 1\leq i < j \leq
  N, modulo (10^9+7).
samples: [{"input": "3\n    1 2 3", "output": "11\n    \n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\n* * *"}, {"input": "4\n    141421356 17320508 22360679 244949", "output": "437235829"}]