The First N Fibonacci Numbers

Read an integer N and print the first N Fibonacci numbers on one line separated by single spaces, with no space after the last one and a newline at the end. The first two terms are 0 and 1, and every later term is the sum of the two before it, so N of 10 prints 0 1 1 2 3 5 8 13 21 34. Keep the terms in long variables. N must be between 1 and 45 so that every term the loop forms fits in a 32-bit long; otherwise print N must be between 1 and 45 and return 1. If N cannot be read, print invalid input and return 1.