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

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 200005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(long double x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { cout << "]" << endl; } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
 
#ifdef LOCAL
using namespace output;
#else
#define dbg(x...) 4
#endif

vl divisors;
map<ll, int> ind;
ll dp[6720][6720];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, k; 
    cin >> n >> k;
    divisors.pb(1);
    ind[1] = sz(divisors);
    for (ll x = 2; x <= sqrt(n); x++) {
        if (n % x == 0) {
            ind[x] = sz(divisors);
            divisors.pb(x);
        }
        if((x != (n / x)) && (n % (n / x)) == 0) {
            ind[n / x] = sz(divisors);
            divisors.pb(n / x);
        }
    }
    ind[n] = sz(divisors);
    divisors.pb(n);
    dp[1][0] = 1;
    int cnt = sz(divisors);
    for (int i = 1; i < cnt; i++) {
        for (int j = 0; j < cnt; j++) {
            ll prod = divisors[j];
            ll add = divisors[i];
            dp[i + 1][j] += dp[i][j];
            if (prod * add <= n && ind.count(prod * add)) {
                dp[i][ind[prod * add]] += dp[i][j];
            }
        }
    }
    ll tot = 0;
    for (int i = 0; i < cnt; i++) {
        if ((n % divisors[i]) != 0) {
            continue;
        }
        ll need = n / divisors[i];
        if (ind.count(need)) {
            tot += dp[i][ind[need]];
        }
    }
    cout << tot << '\n';
    cout << 1 << '\n';
}