#include <fstream>
#include <iostream>
using namespace std;

struct NOD
{
    int inf;
    NOD* urm;
};

NOD *prim,*ultim;

void creare(int x)
{
    prim=new NOD;
    prim ->inf=x;
    prim->urm=NULL;
    ultim=prim;
}

void adaugare(int x)
{
    NOD *nou;
    nou= new NOD;
    nou->inf=x;
    nou->urm=NULL;
    ultim->urm=nou;
    ultim=nou;
}
void adaugaref(int x)
{
    NOD *nou;
    nou= new NOD;
    nou->inf=x;
    nou->urm=prim;
   prim=nou;
}
int Maxim()
{
    NOD *p=prim;
    int Max=0;
    while(p!=NULL)
    {
        Max=max(Max,p->inf);
        p=p->urm;
    }
    return Max;
}
void inserare(int x)
{
    int M=Maxim();
    NOD *p;
    p=prim;
    while(p->inf!=M){
        p=p->urm;}
       NOD *nou;
       nou=new NOD;
       nou->urm=p->urm;
       p->urm=nou;
}



void afisare()
{
    NOD *p;
    p=prim;
    while(p!=NULL)
    {
        cout<<p->inf<<' ';
        p=p->urm;
    }
}

int main()
{
    ifstream in("lista.in");
    int x;
    in>>x;
    creare(x);
    inserare(x);
    while(in>>x)
    {
        adaugare(x);

    }
    int M= Maxim(),y;
    y=invers(M);
    inserare(y,M);
    afisare();
    return 0;
}