output_description: Print the sum modulo 998244353.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_0\ A_1\ \cdots\ A_{N-1}
attempt: from math import gcd
  
  
  def p_c():
      N = int(input())
      A = list(map(int, input().split()))
  
      ans = 0
  
      for i in range(N):
          for j in range(i + 1, N):
              g = gcd(A[i], A[j])
              l = A[i] * A[j] // g
              # print("GCD: {}".format(g))
              # print("LCM: {}".format(l))
              ans += l
              ans %= 998244353
  
      print(ans)
  
  
  if __name__ == "__main__":
      p_c()
  
problem_description: Statement
  
  We have an integer sequence of length N: A_0,A_1,\cdots,A_{N-1}.
  
  Find the following sum (\mathrm{lcm}(a, b) denotes the least common multiple
  of a and b):
  
    * \sum_{i=0}^{N-2} \sum_{j=i+1}^{N-1} \mathrm{lcm}(A_i,A_j)
  
  Since the answer may be enormous, compute it modulo 998244353.
samples: [{"input": "3\n    2 4 6", "output": "22\n    \n\n\\mathrm{lcm}(2,4)+\\mathrm{lcm}(2,6)+\\mathrm{lcm}(4,6)=4+6+12=22.\n\n* * *"}, {"input": "8\n    1 2 3 4 6 8 12 12", "output": "313\n    \n\n* * *"}, {"input": "10\n    356822 296174 484500 710640 518322 888250 259161 609120 592348 713644", "output": "353891724"}]