Problem: You are given a positive integer n. Let's build a graph on vertices 1, 2, ..., n in such a way that there is an edge between vertices u and v if and only if <image>. Let d(u, v) be the shortest distance between u and v, or 0 if there is no path between them. Compute the sum of values d(u, v) over all 1 ≤ u < v ≤ n.

The gcd (greatest common divisor) of two positive integers is the maximum positive integer that divides both of the integers.

Input

Single integer n (1 ≤ n ≤ 107).

Output

Print the sum of d(u, v) over all 1 ≤ u < v ≤ n.

Examples

Input

6


Output

8


Input

10


Output

44

Note

All shortest paths in the first example: 

  * <image>
  * <image>
  * <image>
  * <image>
  * <image>
  * <image>



There are no paths between other pairs of vertices.

The total distance is 2 + 1 + 1 + 2 + 1 + 1 = 8.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 5;
int n;
int lp[N], a[N], phi[N];
long long pre[N];
vector<int> pr;
void calc() {
  phi[1] = 1;
  for (int i = 2; i < N; ++i) {
    if (lp[i] == 0) {
      lp[i] = i;
      phi[i] = i - 1;
      pr.push_back(i);
    } else {
      if (lp[i] == lp[i / lp[i]])
        phi[i] = phi[i / lp[i]] * lp[i];
      else
        phi[i] = phi[i / lp[i]] * (lp[i] - 1);
    }
    for (int j = 0; j < (int)pr.size() && pr[j] <= lp[i] && i * pr[j] < N; ++j)
      lp[i * pr[j]] = pr[j];
  }
}
int main() {
  scanf("%d", &n);
  calc();
  long long ans = 0;
  for (int i = 2; i <= n; i++) ans -= i - 1 - phi[i];
  for (int i = 2; i <= n; i++) pre[lp[i]]++;
  for (int i = 2; i <= n; i++) pre[i] += pre[i - 1];
  for (int i = 2; i <= n; i++) {
    ans += pre[n / lp[i]];
    if ((long long)lp[i] * lp[i] <= n) ans--;
    if (lp[i] == i and i * 2 <= n) ans += max(pre[i - 1] - pre[n / i], 0LL) * 3;
  }
  printf("%lld\n", ans);
  return 0;
}