B'Chaneka has an array [a_1,a_2, ldots,a_n] . Initially, all elements are white. Chaneka will choose one or more different indices and colour the elements at those chosen indices black. Then, she will choose all white elements whose indices are multiples of the index of at least one black element and colour those elements green. After that, her score is the maximum value of a_i out of all black and green elements. There are 2^n-1 ways for Chaneka to choose the black indices. Find the sum of scores for all possible ways Chaneka can choose the black indices. Since the answer can be very big, print the answer modulo 998 ,244 ,353 . The first line contains a single integer n ( 1 <= q n <= q 10^5 ) -- the size of array a . The second line contains n integers a_1,a_2,a_3, ldots,a_n ( 0 <= q a_i <= q10^5 ). An integer representing the sum of scores for all possible ways Chaneka can choose the black indices, modulo 998 ,244 ,353 . In the first example, below are the 15 possible ways to choose the black indices: The total sum is 19+14+19+9+19+19+19+19+14+19+19+19+19+19+19 = 265 . '...