A factory conveyor line carries a single-file sequence of parts, and each part is stamped with an integer tag as it passes the scanner. Quality control has flagged one tag value for an immediate recall: every part stamped with that tag must be pulled off the line, while every other part keeps moving, and the parts that remain must end up pressed back together, in their original relative order, with no gaps left behind. Given the tag sequence read off the line and the recalled tag value, report the sequence of tags that remains on the line after the sweep.

Input format

• Line 1: a single integer n (0 <= n <= 200000) — the number of parts currently on the line.
• Line 2: n space-separated integers, the tag stamped on each part in line order (this line may be blank when n == 0).
• Line 3: a single integer target (-10^9 <= target <= 10^9) — the recalled tag value.

Output format

Print the tags remaining on the line, in their original order, separated by single spaces, on one line. If no parts remain, print an empty line.

Constraints

• Every tag and target satisfies -10^9 <= value <= 10^9.
• Tags may repeat, and duplicates that are not equal to target must all be kept.
• The recalled tag may appear zero, one, or many times among the parts.

6
7 1 7 3 7 5
7

1 3 5

4
2 4 6 8
5

2 4 6 8