124. Insert at the Beginning

Foundation1000 ms256 MBSolved by 0%

Build the list, read a value k, insert a new node holding k at the front, and print the resulting list separated by single spaces.

Inserting at the front is the one operation that changes head itself.

Constraints - `0 ≤ n ≤ 100000` - `-1000000 ≤ value, k ≤ 1000000`

Input

The first line contains an integer n, the number of nodes. The second line contains n space-separated integers — the node values from head to tail. The starter code builds the list for you; work on the nodes, not the array. The third line contains the value to insert at the front.

Output

Print the resulting list from head to tail on ONE line, separated by single spaces, or Empty if no nodes remain.

Input3 2 3 4 1

Output1 2 3 4

Noteinserts in front of an existing list

Input0 5

Output5

Noteinserts into an empty list, where the new node becomes the entire list

Hint 1Approach

Hint 2Approach

Hint 3Pseudocode

Hint 4Full solution