Problem: You are given a multiset S. Over all pairs of subsets A and B, such that:

  * B ⊂ A; 
  * |B| = |A| - 1; 
  * greatest common divisor of all elements in A is equal to one; 



find the sum of ∑_{x ∈ A}{x} ⋅ ∑_{x ∈ B}{x}, modulo 998 244 353.

Input

The first line contains one integer m (1 ≤ m ≤ 10^5): the number of different values in the multiset S.

Each of the next m lines contains two integers a_i, freq_i (1 ≤ a_i ≤ 10^5, 1 ≤ freq_i ≤ 10^9). Element a_i appears in the multiset S freq_i times. All a_i are different.

Output

Print the required sum, modulo 998 244 353.

Examples

Input


2
1 1
2 1


Output


9


Input


4
1 1
2 1
3 1
6 1


Output


1207


Input


1
1 5


Output


560

Note

A multiset is a set where elements are allowed to coincide. |X| is the cardinality of a set X, the number of elements in it.

A ⊂ B: Set A is a subset of a set B.

In the first example B=\{1\}, A=\{1,2\} and B=\{2\}, A=\{1, 2\} have a product equal to 1⋅3 + 2⋅3=9. Other pairs of A and B don't satisfy the given constraints.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
int N = 100000;
long long frep[101010];
int mu[101010];
long long qpow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ret;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    frep[a] = b;
  }
  mu[1] = 1;
  for (int i = 1; i <= N; i++) {
    for (int j = i * 2; j <= N; j += i) mu[j] -= mu[i];
  }
  long long ans = 0;
  for (int i = 1; i <= N; i++) {
    long long s = 0, sq = 0;
    long long K = 0;
    for (int j = i; j <= N; j += i) {
      K += frep[j];
      s = (s + frep[j] * j) % mod;
      sq = (sq + frep[j] * j % mod * j) % mod;
    }
    if (K < 2) continue;
    long long t1 = sq * qpow(2, K - 2) % mod * ((K - 1) % mod) % mod;
    long long n2 = (s * s + mod - sq) % mod;
    long long t2 = qpow(2, K - 2);
    if (K >= 3) t2 = (t2 + ((K - 2) % mod) * qpow(2, K - 3)) % mod;
    t2 = t2 * n2 % mod;
    ans = (ans + ((t1 + t2) % mod * mu[i] + mod)) % mod;
  }
  printf("%lld", ans);
  return 0;
}