Given a linked list of integers, return a reference to the head of a similar linked list with all odd values removed.
For example, your linked list values are 2 → 1 → 3 → 4 → 6. Your new linked list should be 2 → 4 → 6.
The first line contains an integer n, the number of nodes in the list. Each of the next n lines contains an integer node->data.