using System;

​

public class Node<T>

{

    private T value;

    private Node<T> next;

    public Node(T value)

    {

        this.value = value;

        this.next = null;

    }

​

    public Node(T value, Node<T> next)

    {

        this.value = value;

        this.next = next;

    }

​

    public T GetValue()

    {

        return this.value;

    }

​

    public Node<T> GetNext()

    {

        return this.next;

    }

​

    public bool HasNext()

    {

        return (this.next != null);

    }

​

    public void SetValue(T value)

    {

        this.value = value;

    }

​

    public void SetNext(Node<T> next)

    {

        this.next = next;

    }

}

​

public class Program

{

    public static Node<int> BuildList()

    {

        Node<int> list = null;

        //Node<int> p;

        int num = int.Parse(Console.ReadLine());

        if (num != -99)

        {

            list = new Node<int>(num);

            Node<int> last = list;

            num = int.Parse(Console.ReadLine());

            while (num != -99)

            {

                last.SetNext(new Node<int>(num));

                last = last.GetNext();

                num = int.Parse(Console.ReadLine());

            }

        }

​

        return list;

    }

​

    public static char Q1(Node<int> p)

    {

        int counterEven = 0;

        int counterOdd = 0;

        while (p != null)

        {

            if (p.GetValue() % 2 == 0)

            {

                counterEven++;

            }

            else

            {

                counterOdd++;

            }

​

            p = p.GetNext();

        }

​

        if (counterEven > counterOdd)

            return 'z';

        else if (counterEven < counterOdd)

            return 'e';

        else

            return 's';

    }

​

    public static void Q2(Node<int> list)

    {

        while (list != null && list.GetNext() != null)

        {

            if (list.GetValue() > list.GetNext().GetValue())

            {

                Console.WriteLine(list.GetValue());

            }

​

            list = list.GetNext();

        }

    }

​

    public static void Q3(Node<int> list, int place1, int place2)

    {

        Node<int> first = list;

        for (int i = 0; i < place1; i++)

        {

            list = list.GetNext();

        }

​

        Console.WriteLine(list.GetValue());

        list = first;

        for (int i = 0; i < place2; i++)

        {

            list = list.GetNext();

        }

​

        Console.WriteLine(list.GetValue());

    }

​

    public static Node<int> Q4(Node<int> head, int num)

    {

        Node<int> dummy = new Node<int>(0);

        Node<int> temp = new Node<int>(0);

        dummy.SetNext(head);

        Node<int> p = dummy;

        while (p != null && p.GetNext() != null)

        {

            temp = p.GetNext();

            while (temp != null && temp.GetValue() == num)

            {

                temp = temp.GetNext();

            }

​

            p.SetNext(temp);

            p = p.GetNext();

        }

​

        return dummy.GetNext();

    }

​

    public static Node<int> Q5(Node<int> p, int num)

    {

        while (p != null)

        {

            if (p.GetValue() == num)

            {

                return p;

            }

​

            p = p.GetNext();

        }

​

        return p;

    }

​

    public static int Q6A(Node<int> p, int num)

    {

        int counter = 0;

        while (p != null)

        {

            if (p.GetValue() == num)

            {

                counter++;

            }

​

            p = p.GetNext();

        }

​

        return counter;

    }

​

    public static int Q6B(Node<char> p)

    {

        int[] counter = new int[26];

        int MinCounter;

        while (p != null)

        {

            counter[(int)(p.GetValue()) - 97]++;

            p = p.GetNext();

        }

​

        MinCounter = counter[0];

        for (int i = 0; i < 26; i++)

        {

            if (counter[i] < MinCounter)

            {

                MinCounter = counter[i];

            }

        }

​

        return MinCounter;

    }

​

    public static void Main()

    {

        Console.WriteLine("Hello World");

        Node<int> list = BuildList();

        Console.Clear();

        Node<int> p = list;

        Console.WriteLine("Question 1: " + Q1(p));

        Console.WriteLine("Question 2: ");

        Q2(p);

        Console.WriteLine("Question 3: ");

        Q3(p, 1, 2);

        Console.WriteLine("Question 4: ");

        Q4(p, 2);

        Console.WriteLine("Question 5: ");

        Console.WriteLine("Question 6A: " + Q6A(p, 2));

        Console.WriteLine("Question 6B: " + Q6B(P)); //אם היה פונקציה לבנייה של צארים אז כנראה שזה היה עובד

        while (p != null)

        {

            Console.Write(p.GetValue() + ", ");

            p = p.GetNext();

        }

    }

}