class list {
    Noeud first;
}
 class Noeud {
    Noeud next;
    int val;
 }

  list creerlist()
  {
    list L = new list();
    L.first = null;
    return L;
  }

    void inversion (list l)
    {
        Noeud c = l.first;
        Noeud max = l.first;
        Noeud min = l.first;
        while(c != null)
        {
            if (min.val > c.val)
            {
                min = c;
            }
            if(max.val < c.val)
            {
                max = c;
            }
            c = c.next;
        }
        int temp = min.val;
        min.val = max.val;
        max.val = temp;
    }
    void supprimer (Noeud n)
    {
        if(n.next != null)
        {
            n = n.next;
        }
        else
        {
            n = null;
        }
    }
        void ajout_fin(list l, int e)
    {
        Noeud n = new Noeud();
        n.val = e;
        n.next = null;
        if(l.first == null)
        {
            l.first = n;
        } else
        {
            Noeud c = l.first;
            Noeud p = c;
            while(c != null)
            {
                p = c;
                c = c.next;
            }
            p.next = n;
        }
    }
    list effacerpair(list l)
    {
        list L2 = new list();
        Noeud n = l.first;
        while (n != null)
        {
            if(n.val % 2 == 1)
            {
                ajout_fin(L2, n.val);
            }
            n = n.next;
        }
        return L2;
    }
    void affichage(list l)
    {
        Noeud c = l.first;
        while (c != null)
        {
            print (c.val + " ");
            c = c.next;
        }
        println("");
    }
void main(){
    list L = creerlist();
    list L2 = creerlist();
    L.first = new Noeud();
    L.first.val = 3;
    L.first.next = new Noeud();
    L.first.next.val = 8;
    L.first.next.next = new Noeud();
    L.first.next.next.val  = 7;
    L.first.next.next.next = new Noeud();
    L.first.next.next.next.val = 15;
    list L3 = effacernoeud(L);
    affichage(L3);
}