Print Fibonacci series up to n terms recursively.

Difficulty: Hard

Phase: 3 · Recursion

XP Reward: 30 XP

Topics: Recursion, Hard

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

Problem Description

Given positive integer N, print first N terms of Fibonacci sequence separated by space using recursion. 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: 6

Output: 0 1 1 2 3 5

Explanation: Sample execution for input 6