Print pattern of numbers recursively (1 to n each row).

Difficulty: Hard

Phase: 3 · Recursion

XP Reward: 30 XP

Topics: Recursion, Hard

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

Problem Description

Given N, print number triangle where row i contains 1 to i space-separated 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 1 2 1 2 3

Explanation: Sample execution for input 3