Re-arrange Linked List in Pairs

Given a singly-linked list, re-arrange the list such that the first and it's corresponding last node are together one after the other as shown below in the examples.

---

Examples:

List: Node1->Node2->Node3..... ->Node(N-3)->Node(N-2)->Node(N-1)
Reordered List: Node1->Node(N-1)->Node2->Node(N-2)->Node3->Node(N-3)......
1->2->3->4 ==> 1->4->2->3
1->2->3->4->5 ==> 1->5->2->4->3