#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint N;
  cin >> N;
  if(N == 0) {
    cout << -1 << endl;
  } else {
    vector<lint> res;
    for(lint i=1; i*i<=N; i++) {
      if (N%i == 0) {
        res.push_back(i);
        if (N/i != i) res.push_back(N/i);
      }
    }
    sort(ALL(res));
    vector<lint> ans;
    ans.push_back(N);
    vector<bool> valid(res.size(), true);
    valid[res.size()-1] = false;
    IREP(i, res.size()-1) if(valid[i]) {
      ans.push_back(res[i]);
      set<lint> res2;
      N = res[i];
      for(lint i=1; i*i<=N; i++) {
        if (N%i == 0) {
          res2.insert(i);
          if (N/i != i) res2.insert(N/i);
        }
      }
      REP(j, res.size()) if(res2.find(res[j]) != res2.end()) valid[j] = !valid[j];
    }
    cout << ans.size() << endl;
    REP(i, ans.size()) cout << ans[i] << (i!=ans.size()-1 ? " " : "");
    cout << "\n";
  }
}