Late admissions

Problem

A class list is full, and m late admissions arrive. Make a new, longer list that keeps every old name and adds the new ones at the end. The old list must stay exactly as it was.

Input, output and limits

Input: Line 1: n. Line 2: n names. Line 3: m. Line 4: m new names (empty when m is 0).
Output: Old list (<n>): <names> and New list (<n + m>): <names>, names separated by single spaces.
Constraints: 1 ≤ n ≤ 100
0 ≤ m ≤ 100
Names are single words

Examples

Example

Input

3
Asha Ravi Imran
1
Zoya

Output

Old list (3): Asha Ravi Imran
New list (4): Asha Ravi Imran Zoya

Arrays.copyOf(names, 4) keeps the three names and leaves one empty slot for Zoya.

Hints

Try the problem first. Open one hint at a time.

Hint 1

Arrays.copyOf(names, n + m) makes the longer array and copies the old names into it.

Hint 2

Fill the new slots from index n to n + m - 1.

Write your Java code, run it on the examples and submit it to hidden tests.

Solve in the editor

All Java problems

Problem

Input, output and limits

Examples

Hints

More Copying Objects problems

Problem

Input, output and limits

Examples

Hints

More Copying Objects problems