#include<iostream>
#include<conio.h>
using namespace std;

struct Nod

      {int info;
       Nod *urm,*prec;
       };

Nod *prim, *ultim;

int palindrom(Nod *prim)
 {Nod *p,*u;
  u=prim;
  while(u->urm)
   u=u->urm;
  p=prim;
  while(p!=u && u->urm!=p)
   {if(u->info !=p->info) return 0;
    p=p->urm;
    u=u->prec;
   }
  return 1;
 }

void listare()
{Nod *c;
 c=prim;
 while(c)
    {cout<<c->info<<"   ";
     c=c->urm;}
}

void mutaup()
 {Nod *u=prim;
  while(u->urm) u=u->urm;
  u->prec->urm=0;
  u->prec=0;
  u->urm=prim;
  prim->prec=u;
  prim=u;
 }

void creare_lista()

{Nod *c;
 c=new Nod;
 cout<<"info ";
 cin>>c->info;
 if(!prim)
   {prim=c;
    prim->urm=0;
    prim->prec=0;
    ultim=prim;
    }
 else
   {ultim->urm=c;
    c->prec=ultim;
    ultim=c;
    ultim->urm=0;
   }
}



int main()
   {int n,i;
    cout<<"Nr elemente lista"; cin>>n;
    for(i=1;i<=n;i++) creare_lista();
    if(palindrom(prim)==1 ) cout<<"palindorm 1 "<<endl;
        else cout<<"palindrom 0"<<endl;
    mutaup();
    cout<<"lista cu ultimul nod mutat este "<<endl;
    listare();
    getch();
    return 0;
    }