E

#include <iostream>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;

long long count(long long n) {
	long long k = 0;
	for (long long i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			k += 2;
			if (n / i == i) k--;
		}
	}
	return k;
}
bool isprime(long long n) {
	for (long long i = 2; i * i <= n; i++) {
		if (n % i == 0) {
			return 0;
		}
	}
	return 1;
}

int main() {
	vector<long long> primes;
	long long n;
	cin >> n;
	long long t = 1;
	bool f = 1;
	for (long long i = 2; f ; i++) {
		if (isprime(i)) {
			t *= i;
			primes.push_back(i);
			for (int j = 0; j < primes.size(); j++) {
				if (t * primes[j] > n) {
					f = 0;
					break;
				}
			}
		}
		cout << i << endl;
	}
	while (t * 2 <= n) {
		t *= 2;
	}
	cout << count(t) << ' ' << t;


	return 0;
}