#include <fstream>
using namespace std;

ifstream fin("liste.in");
ofstream fout("liste.out");

struct NODD {int inf; struct NODD*urm,*pre;};
typedef NODD *ListaD;

ListaD A;

int n,nr;
char s[10];

void inserare(Listad prim, int x, Listad p)
{
    Listad q=new NODD;
    q->inf=x;
    if (!p)//inserez la inceput
    {
        q->urm=prim
        q->pre=0;
        prim=q;
    }
    else //inserez dupa nodul indicat de p
    {
        q->urm=p->urm;
        q->pre=p;
        if (p->urm) q->urm->pre=q;
        p->urm=q;
    }
}

void parcurgere_directa (Listad prim)
{
    Listad p;
    for (p=prim, p, p=p->urm)
    {
        //fac ceva
    }
    return;
}

int main()
{