int suma(nod *p)
{ nod *s=p, *k, *f;
 int sum=0;
 k=s->urm;
 f=k->urm;
 while(f!=NULL)
 { if(k->info%2!=0)
     if(s->info%2==0 && f->info%2==0)
        sum=sum+k->info;
  s=k;
  k=f;
  f=f->urm;
 }
 return sum;

}