Problem: Jzzhu has picked n apples from his big apple tree. All the apples are numbered from 1 to n. Now he wants to sell them to an apple store. 

Jzzhu will pack his apples into groups and then sell them. Each group must contain two apples, and the greatest common divisor of numbers of the apples in each group must be greater than 1. Of course, each apple can be part of at most one group.

Jzzhu wonders how to get the maximum possible number of groups. Can you help him?

Input

A single integer n (1 ≤ n ≤ 105), the number of the apples.

Output

The first line must contain a single integer m, representing the maximum number of groups he can get. Each of the next m lines must contain two integers — the numbers of apples in the current group.

If there are several optimal answers you can print any of them.

Examples

Input

6


Output

2
6 3
2 4


Input

9


Output

3
9 3
2 4
6 8


Input

2


Output

0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10, mod = 1e9 + 7, MAX_N = 100000;
long long n;
vector<int> prim, hlp;
vector<pair<int, int> > ans;
bool prm[N], vis[N];
void sieve() {
  memset(prm, 1, sizeof prm);
  prm[0] = prm[1] = 0;
  for (int i = 2; i * i <= MAX_N / 2; i++) {
    if (prm[i])
      for (int j = i * i; j <= MAX_N; j += i) prm[j] = 0;
  }
  for (int i = 1; i <= MAX_N / 2; i++)
    if (prm[i]) prim.push_back(i);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  sieve();
  hlp.clear();
  for (int i = prim.size() - 1; i >= 0; i--) {
    int x = prim[i];
    for (int j = x; j <= n; j += x) {
      if (!vis[j]) hlp.push_back(j);
    }
    if ((int)hlp.size() % 2 && hlp.size() > 1) hlp.erase(hlp.begin() + 1);
    for (int k = 0; k < hlp.size() && hlp.size() != 1; k += 2)
      ans.push_back({hlp[k], hlp[k + 1]}), vis[hlp[k]] = vis[hlp[k + 1]] = 1;
    hlp.clear();
  }
  cout << ans.size() << "\n";
  for (int i = 0; i < ans.size(); i++)
    cout << ans[i].first << " " << ans[i].second << "\n";
}