#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL,LL> PLL;
typedef pair<int,int> PII;
typedef pair<PII,PII> PPII;
#define B_E(x) x.begin(),x.end()
#define PB push_back
#define MP make_pair
#define S second
#define F first
inline void file()
{
#ifdef _WIN32
    return;
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    if (0) {
        freopen(".in",  "r", stdin);
        freopen(".out", "w", stdout);
    }
}

const clock_t MAXT = (100*CLOCKS_PER_SEC)/1000;
const int   PX[8] = {0,1,0,-1,1,1,-1,-1},
            PY[8] = {1,0,-1,0,1,-1,-1,1},
            N = 1e5 + 10,
            INF = 1e9,
            MOD = 1e9+7;
const LL    INFL = 1e18,
            MODL = 1e9 + 7;
const LD    EPS = 1e-6;


LL cnt[70];
LL dp[70][120000];
int k,st[10];

/**











*/




inline void factorization(LL n) {
    vector<int> d;
    for (int i=2; i*i <= n; ++i)
        if ( !(n%i) ) {
            d.PB(0);
            while ( !(n%i) ) {
                n /= i;
                d.back()++;
            }
        }

    if ( n > 1 )
        d.PB(1);

    k = d.size();
    int mask = 1<<k;
    for (int i=0; i<mask; ++i) {
        LL sum = 1;
        for (int j=0; j<k; ++j)
            if ( i&(1<<j) )
                sum *= d[j]-1;

        cnt[i] = sum;
    }

    d.clear();

}

inline void push_dp(int mask, int posd, int d)
{

    char usd[8];
    memset(usd, 0, 8);

    for (int i=0; i<k; ++i)
        if ( d&(1<<i) )
            usd[ (posd/st[i])%7 ]++;

    int cnt = 0;
    for (int i=1; i<8; ++i)
        if ( usd[i] )
            ++cnt;

    if ( cnt >= 2 )
        return;

    int new_mask,new_posd;
    new_mask = mask;
    new_posd = posd;

    for (int i=0; i<k; ++i)
        if ( (d&(1<<i)) ) {
            int s = (posd/st[i])%7;

            if ( s ) {
                usd[s]--;
                new_posd -= s*st[i];
                new_mask |= 1<<i;
            } else {
                for (int j=1; j<k; ++j)
                    if ( !usd[j] ) {
                        new_posd += st[i] * j;
                        ++usd[j];
                        break;
                    }
            }

        }

    dp[new_mask][new_posd] += dp[mask][posd] * ::cnt[d];
    dp[new_mask][new_posd] %= MODL;

}


inline int solve()
{

    st[0] = 1;
    for (int i=1; i<=k; ++i)
        st[i] = st[i-1] * 7;

    int max_mask,max_st7;
    max_st7 = st[k];
    max_mask = 1<<k;
    dp[0][0] = 1;

    for (int m=0; m<max_mask; ++m)
    for (int i=0; i<max_st7; ++i)
        if ( dp[m][i] )
            for (int j=0; j<max_mask; ++j)
                if ( !(j&m) )
                    push_dp(m,i,j);

    for (int m=0; m<max_mask; ++m)
    for (int i=0; i<max_st7; ++i)
        if ( dp[m][i] )
        cout<<setw(3)<<m<<' '<<i<<' '<<dp[m][i]<<'\n';

    return 0;
}


int main()
{ file();

    LL n;
    cin>>n;
    factorization(n);

    cout<<solve()<<'\n';





















}