Print reverse triangle pattern recursively.

Difficulty: Hard

Phase: 3 · Recursion

XP Reward: 30 XP

Topics: Recursion, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given N, print reverse number triangle where row 1 has 1 to N, row 2 has 1 to N-1, etc. recursively. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 3

Output: 1 2 3 1 2 1

Explanation: Sample execution for input 3