# Divide into 2 groups

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Divide the numbers $1,2,...,n$ into two groups so that the absolute difference between the sums of the elements in both groups be the smallest as possible.

## Input

One integer $n(2≤n≤10_{5})$.

## Output

In the first line print two positive integers — the number of elements in the first and the second group.

In the second line print the elements from the first group, in the third line print the elements from the second group.

You can print the elements of each group in any order, but the elements in two groups must contain positive integers in the range $[1,n]$.

## Examples

Input #1

Answer #1

Input #2

Answer #2

Submissions 1K

Acceptance rate 40%