Print Zigzag

easy

1. Here are a few sets of inputs and outputs for your reference
Input1 -&gt; 1
Output1 -&gt; 1 1 1

Input2 -&gt; 2
Output2 -&gt; 2 1 1 1 2 1 1 1 2

Input2 -&gt; 3
Output3 -&gt; 3 2 1 1 1 2 1 1 1 2 3 2 1 1 1 2 1 1 1 2 3

2. Figure out the pattern and complete the recursive function pzz to achieve the above for any positive number n.

Note -&gt; The online judge can't force you to write the function recursively but that is what the spirit of question is.Write recursive and not iterative logic. The purpose of the question is to aid learning recursion and not test you.

Input Format

A number n

Output Format

As discussed in point 1 of description

Constraints

1 &lt;= n &lt;= 10

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

3 2 1 1 1 2 1 1 1 2 3 2 1 1 1 2 1 1 1 2 3

Power-logarithmic