Description
The Pascal sequence of order n generates n integers, in which the kth element is defined as
For example: if n = 3, the sequence is 1 3 3 1.
Input
There will be multiple test cases. No number of test cases is given. Each case is given in a single lines, containing an integer n (1 <= n <= 1000).
Output
For each case, output the Pascal sequence. Two consecutive numbers are separated by a space. All numbers should be mod by 1000007.