Double reverse#1460

Double reverse

1 second

122.174 megabytes

Very easy

Given a sequence of natural numbers $1, 2, 3, \dots, n$ 1, 2, 3, \ldots, n ( $1 \leq n \leq 1000$ 1 \leq n \leq 1000). Rearrange, in reverse order, the segment of this sequence from the $a$ -th to the $b$ -th element, and then reverse the segment from the $c$ -th to the $d$ -th element ( $a < b$ a < b, $c < d$ c < d, $1 \leq a, b, c, d \leq 1000$ 1 \leq a, b, c, d \leq 1000).

Input

The integers $n$ , $a$ , $b$ , $c$ , $d$ are given.

Output

Output the resulting sequence.

Examples

Example 1

Loading

Example 2

Loading

1, 2, 3, \dots, n

1 \leq n \leq 1000

a < b

c < d

1 \leq a, b, c, d \leq 1000