#include<stdio.h>

int main ()

{

    int n;

    int i;

    double sum;

    while(scanf("%d",&n),n)

    {

        sum=;

        sum+=n*;

        for (i=;i<=n;i++)

        {

            sum+=1.0/i*(n-i+)*;

        }

        printf ("%.2f\n",sum);

    }

    return ;

}

#include<bits/stdc++.h>

using namespace std;

struct Fraction

{

    int up,down;//分子 分母

    //Fraction(){}

    Fraction(int _up=,int _down=):up(_up),down(_down){}

};

int gcd(int a,int b)

{

    if(b==) return a;

    return gcd(b,a%b);

}

Fraction reduction(Fraction result)//分数的化简

{

    if(result.down<){//分母为负数，令分子和分母都变为相反数

        result.down=-result.down;

        result.up=-result.up;

    }

    if(result.up==) result.down=;//如果分子为0 分母为1

    else{//约去最大公约数

        int d=gcd(abs(result.up),abs(result.down));

        result.up/=d;

        result.down/=d;

    }

    return result;

}

int main()

{

    int n;

    while(scanf("%d",&n)==&&n!=){

        Fraction s[n*n+];

        for(int i=;i<=n;i++){

            s[n*(i-)+i].up=;

            s[n*(i-)+i].down=;

        }

        for(int i=;i<=n;i++){

            for(int j=;j<=n;j++){

                if(i!=j){

                    if(j>i){

                        s[n*(i-)+j].down=s[n*(i-)+j-].down+;

                        s[n*(i-)+j].up=;

                    }

                }

            }

        }

        for(int i=;i<=n;i++){

            for(int j=;j<=n;j++){

                if(j<i){

                    s[n*(i-)+j].down=s[n*n+-n*(i-)-j].down;

                    s[n*(i-)+j].up=;

                }

            }

        }

        Fraction c;

        c.down=s[].down;

        c.up=s[].up;

        for(int i=;i<=n*n;i++){

            c.up=s[i].up*c.down+c.up*s[i].down;

            c.down=s[i].down*c.down;

            c=reduction(c);

            cout<<c.up<<" "<<c.down<<endl;

        }

        printf("%.2f\n",1.0*c.up/c.down);

    }

    return ;

}