description: For an array b of n integers, the extreme value of this array is the minimum number of times (possibly, zero) the following operation has to be performed to make b non-decreasing: 
  
    * Select an index i such that 1 ≤ i ≤ |b|, where |b| is the current length of b. 
    * Replace b_i with two elements x and y such that x and y both are positive integers and x + y = b_i. 
    * This way, the array b changes and the next operation is performed on this modified array. 
  
  
  
  For example, if b = [2, 4, 3] and index 2 gets selected, then the possible arrays after this operation are [2, \underline{1}, \underline{3}, 3], [2, \underline{2}, \underline{2}, 3], or [2, \underline{3}, \underline{1}, 3]. And consequently, for this array, this single operation is enough to make it non-decreasing: [2, 4, 3] → [2, \underline{2}, \underline{2}, 3].
  
  It's easy to see that every array of positive integers can be made non-decreasing this way.
  
  YouKn0wWho has an array a of n integers. Help him find the sum of extreme values of all nonempty subarrays of a modulo 998 244 353. If a subarray appears in a multiple times, its extreme value should be counted the number of times it appears.
  
  An array d is a subarray of an array c if d can be obtained from c by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10 000) — the number of test cases.
  
  The first line of each test case contains a single integer n (1 ≤ n ≤ 10^5).
  
  The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^5).
  
  It is guaranteed that the sum of n over all test cases doesn't exceed 10^5.
  
  Output
  
  For each test case, print a single integer — the sum of extreme values of all subarrays of a modulo 998 244 353.
  
  Example
  
  Input
  
  
  4
  3
  5 4 3
  4
  3 2 1 4
  1
  69
  8
  7264 40515 28226 92776 35285 21709 75124 48163
  
  
  Output
  
  
  5
  9
  0
  117
  
  Note
  
  Let f(l, r) denote the extreme value of [a_l, a_{l+1}, …, a_r].
  
  In the first test case, 
  
    * f(1, 3) = 3, because YouKn0wWho can perform the following operations on the subarray [5, 4, 3] (the newly inserted elements are underlined):
  
  [5, 4, 3] → [\underline{3}, \underline{2}, 4, 3] → [3, 2, \underline{2}, \underline{2}, 3] → [\underline{1}, \underline{2}, 2, 2, 2, 3];
  
    * f(1, 2) = 1, because [5, 4] → [\underline{2}, \underline{3}, 4];
    * f(2, 3) = 1, because [4, 3] → [\underline{1}, \underline{3}, 3];
    * f(1, 1) = f(2, 2) = f(3, 3) = 0, because they are already non-decreasing. 
  
  
  
  So the total sum of extreme values of all subarrays of a = 3 + 1 + 1 + 0 + 0 + 0 = 5.
solution: import java.io.*;
  import java.util.*;
  import java.lang.*;
  
  
  public class Main {
      public static int extremeExtension(long[] array, int l, int r) {
          int result = 0;
          for (int i = r - 1; i >= l; i--) {
              if (array[i] <= array[i + 1]) {
                  continue;
              } else {
                  long k = (long) Math.ceil((array[i] * 1.0) / array[i + 1]);
                  result += (k - 1);
                  array[i] = (long) Math.floor((array[i] * 1.0) / k);
              }
          }
          return result;
      }
  
      public static int f(int ai, int x) {
          return (int) Math.floor((ai * 1.0) / ((int) Math.ceil((ai * 1.0) / x)));
      }
  
      public static void main(String[] args) throws Exception {
          int T = r.readInt();
          for (int t = 0; t < T; t++) {
              int n = r.readInt();
              int[] a = new int[n + 1];
              for (int i = 1; i <= n; i++) {
                  a[i] = r.readInt();
              }
              int N = (int) 1e5 + 9, mod = 998244353;
              long ans = 0;
              ArrayList<Integer>[] v = new ArrayList[2];
              v[0] = new ArrayList<>();
              v[1] = new ArrayList<>();
              int[][] dp = new int[2][N];
              for (int i = n; i >= 1; i--) {
                  int k = i & 1;
                  int last = a[i];
                  dp[k][last] = 1;
                  v[k].add(last);
                  for (int x : v[k ^ 1]) {
                      int y = dp[k ^ 1][x];
                      int split = (a[i] + x - 1) / x;
                      int st = a[i] / split;
                      ans += 1L * (split - 1) * y * i;
                      dp[k][st] += y;
                      if (last != st) {
                          v[k].add(st);
                          last = st;
                      }
                  }
                  for (int x : v[k ^ 1])
                      dp[k ^ 1][x] = 0;
                  v[k ^ 1].clear();
                  ans %= mod;
              }
              w.writer.println(ans);
              w.writer.flush();
          }
      }
  
      static public InputReader r = new InputReader(System.in);
      static public OutputWriter w = new OutputWriter(System.out);
  
      static public class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private InputReader.SpaceCharFilter filter;
  
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
  
          public int read() {
              if (numChars == -1)
                  throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0)
                      return -1;
              }
              return buf[curChar++];
          }
  
          public int readInt() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public int[] readIntArray(int n) {
              int[] array = new int[n];
              for (int i = 0; i < n; i++) {
                  array[i] = this.readInt();
              }
              return array;
          }
  
          public long[] readLongArray(int n) {
              long[] array = new long[n];
              for (int i = 0; i < n; i++) {
                  array[i] = this.readLong();
              }
              return array;
          }
  
          public long readLong() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public String readString() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              } while (!isSpaceChar(c));
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null)
                  return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          public String next() {
              return readString();
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
  
      static public class OutputWriter {
          private final PrintWriter writer;
  
          public OutputWriter(OutputStream outputStream) {
              writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
          }
  
          public OutputWriter(Writer writer) {
              this.writer = new PrintWriter(writer);
          }
  
          public void print(Object... objects) {
              for (int i = 0; i < objects.length; i++) {
                  if (i != 0)
                      writer.print(' ');
                  writer.print(objects[i]);
              }
          }
  
          public void printLine(Object... objects) {
              print(objects);
              writer.println();
          }
  
          public void close() {
              writer.close();
          }
      }
  }