#include <iostream>
#include <fstream>
using namespace std;
fstream f("liste2.txt");
struct nod {int info;
           nod *urm;};
int n;
nod *p ,*q, *prim1 , *ultim1 , *prim2 , *ultim2 ;
void init(nod *&prim,nod *&ultim)
{
    prim=ultim=NULL;
}
void adauga_nod(nod *&prim,nod *&ultim)
{
    prim=new nod;
    prim->info=n;
    prim->urm=NULL;
    ultim=prim;
}
void adauga_ultim(nod *&ultim)
{
    nod *p=new nod;
    p->info=n;
    p->urm=NULL;
    ultim->urm=p;
    ultim=p;
}
void adauga_prim(nod *&prim)
{
    nod *p=new nod;
    p->info=n;
    p->urm=prim;
    prim=p;
}
int palindrom (nod *prim1,nod *prim2)
{
    nod *p , *q;
    for (p=prim1,q=prim2;p->urm!=NULL;p=p->urm ,q=q->urm)
        if(p->info!=q->info) return 0;
    return 1;
}
int main()
{char c;
f>>c;
n=c-'0';
adauga_nod(prim1,ultim1);
while (f>>c) {n=c-'c';
              adauga_ultim(ultim1);}
f.close();
n=prim1->info;
adauga_nod(prim2,ultim2);
for (p=prim1->urm;p!=NULL;p=p->urm)
{
    n=p->info;
    adauga_prim(prim2);
}
if (palindrom (prim1,prim2)) cout<<"este palyndrom";
                        else cout<<"nu este palyndrom";
    return 0;
}