/*
ID: tgh7281
LANG: C++
TASK: frac1
*/
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a,int b);
int cmp(const void*a,const void*b);
 
struct frac
{
    int a,b;
};
 
int main()
{
    ifstream fin("frac1.in");
    ofstream fout("frac1.out");
    frac f[160*160];
    int n,total;
 
    f[0].a=0;
    f[0].b=1;
    while (fin>>n)
    {
        total=1;
 
        int i,j,g;
        for (i=1;i<=n;i++)
        {
            for (j=i+1;j<=n;j++)
            {
                g=gcd(i,j);
                if (g>1) continue;
                f[total].a=i/g;
                f[total].b=j/g;
                total++;
            }
        }
 
        qsort(f,total,sizeof(f[0]),cmp);
        for (i=0;i<total;i++) fout<<f[i].a<<"/"<<f[i].b<<endl;
        fout<<"1/1"<<endl;
    }
 
    return 0;
}
 
int gcd(int a,int b)
{
    if (b==0) return a;
    return gcd(b,a%b);
}
 
int cmp(const void*a,const void*b)
{
    frac*c=(frac*)a;
    frac*d=(frac*)b;
    return c->a*d->b-d->a*c->b;
}

/*
ID: tgh7281
LANG: C++
TASK: numtri
*/
#include <iostream>
#include <fstream>
using namespace std;
 
int main()
{
    int n,i,j,k,m,size;
    int *num,*max;
    ifstream fin("numtri.in");
    ofstream fout("numtri.out");
 
    fin>>n;
    size=n*(n+1)/2;
    num=(int*)malloc(size*sizeof(int));
    max=(int*)malloc(size*sizeof(int));
 
    for (i=0;i<size;i++) fin>>num[i];
 
    max[0]=num[0];
    for (i=1;i<n;i++)
    {
        for (j=0;j<=i;j++)
        {
            k=i*(i+1)/2+j;
            if (j==0) max[k]=max[i*(i-1)/2]+num[k];
            else if (j==i) max[k]=max[i*(i+1)/2-1]+num[k];
            else
            {
                max[k]=max[(i-1)*i/2+j]>max[(i-1)*i/2+j-1]?max[(i-1)*i/2+j]:max[(i-1)*i/2+j-1];
                max[k] += num[k];
            }
        }
    }
 
    m=0;
    for (i=(n-1)*n/2;i<n*(n+1)/2;i++)
        if (m<max[i]) m=max[i];
    fout<<m<<endl;
 
    free(max);
    free(num);
    fin.close();
    fout.close();
 
    return 0;
}