#include <iostream>
#include <vector>
#include <unordered_set>
#include <set>
#include <deque>
using namespace std;
deque <int> primes(deque <int>& result, int n){
    int i=2;
    while (i*i<=n){
        while (n%i==0){
            result.push_front(i);
            n/=i;
        }
        i++;
    }
    if (n!=1){
        result.push_front(n);
    }
    return result;
}
int main(){
    int n;
    cin>>n;
    if (n==1){
        cout<<0<<endl;
        return 0;
    }
    deque <int> a;
    primes(a, n);
    set <int> b;
    for (auto x:a){
        b.insert(x);
    }
    cout<<b.size()<<"\n";
    for (auto x:b){
        cout<<x<<" ";
    }
    return 0;
}