#include <bits/stdc++.h>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;

void solve() {
  int n;
  cin >> n;
  map<int, int> mem;
  auto foo = [](int n, int base)
  {
    int res = 0;
    while (n != 0)
    {
      res += (n % base) == 0;
      n /= base;
    }
    return res;
  };
  pair<int, vector<int>> ans = {0, {}};
  vector<int> t;
  for (int i = 2; i <= 1e6; i++)
  {
    bool skip = false;
    for (auto j : t)
    {
      skip |= (j * j == i);
    }
    if(skip)
      continue;
    
    t.push_back(i);
    auto del = foo(n, i);
    if(ans.first == del){
      ans.second.push_back(i);
      continue;
    }
    if(ans.first < del){
      ans = {del, {i}};
      continue;
    }
  }
  cout << ans.first << " " << ans.second.size() << '\n';
  for (auto i : ans.second){
    cout << i << ' ';
  }
  cout << '\n';
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
}