#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

typedef long long ll;

ll n,fz[],fm[],s1,s2,ans,w,w2;

//double f[35];

ll gcd(ll x,ll y){return x%y?gcd(y,x%y):y;}

ll getlen(ll x)

{

    ll ret=;

    while(x){ret++; x/=;}

    return ret;

}

int main()

{

    scanf("%lld",&n);

    fz[n]=; fm[n]=;

    for(ll i=n-;i>=;i--)

    {

        ll tfm=(n-i)*fm[i+];

        ll tfz=(n-i)*fz[i+] + n*fm[i+];

        ll k=gcd(tfz,tfm);

        fz[i]=tfz/k; fm[i]=tfm/k;

    }

//    for(ll i=n-1;i>=0;i--)

//        f[i]=f[i+1]+n/(n-i);

//    printf("%lf",f[0]);

    s1=fz[],s2=fm[];

    if(s2==)

    {

        printf("%lld",s1); return ;

    }

    ans=s1/s2,s1%=s2;

    w=getlen(s2);

    if(ans)w2=getlen(ans);

    if(!s1)

    {

        printf("%lld",ans); return ;

    }

    if(ans)

//        while(w2--) printf(" ");//把 w2 减掉了！！！

        for(int i=;i<=w2;i++) printf(" ");

    printf("%lld\n",s1);

    if(ans)printf("%lld",ans);

    while(w--)printf("-"); printf("\n");

    if(ans) while(w2--) printf(" ");

    printf("%lld",s2);

    return ;

}