#include<bits/stdc++.h>
#define Aqrfre(x, y) freopen(#x ".in", "r", stdin),freopen(#y ".out", "w", stdout)
#define mp make_pair
#define Type int
#define qr(x) x=read()
typedef long long ll;
using namespace std;

inline Type read(){
    char c=getchar(); Type x=0, f=1;
    while(!isdigit(c)) (c=='-'?f=-1:f=1), c=getchar();
    while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48), c=getchar();
    return x*f;
}

const int N = 1e7 + 5; 
const int M = 7e5 + 5;

int n, pri[M], a[N], cnt;
bool ifpri[N]; ll num[N], f[N];
int nxt[N], to[N];

inline void Euler(){
	for(int i=2; i<=n; i++){
		if(!a[i]){
			pri[++cnt] = i;
			a[i] = i;
		}
		for(int j=1; j<=cnt; j++){
			if(1ll * i * pri[j] > n or pri[j] > a[i]) break;
			a[i*pri[j]] = pri[j];
		}
	}
    for(int i=1; i<=cnt; i++)
        ifpri[pri[i]] = true, nxt[pri[i]] = pri[i+1];
}

signed main(){ // factorial
    Aqrfre(factorial, factorial);

    qr(n); Euler();

    for(int i=2; i<=n; i++) num[i] = n - i + 1;
    
    for(int i=n; i>=2; i--){
        if(ifpri[i]) continue;
        num[a[i]] += num[i]; num[i/a[i]] += num[i];
    }

    cout<<"f("<<n<<")"<<"=";
    for(int i=1; i<=cnt; i++){
        if(i != 1) cout<<"*";
        cout<<pri[i];
        if(num[pri[i]] > 1) cout<<"^"<<num[pri[i]];
    }



    return 0;
}