Pascal's triangle starts with row 0 = [1]. Each entry is the sum of the two entries above it, and row r has r+1 entries which are the binomial coefficients C(r,0), C(r,1), ..., C(r,r).
Given a 0-indexed row number r, output that row.
Input format
One line: a non-negative integer r.
Output format
One line: the r+1 entries of row r, space-separated.
Constraints
- 0 <= r <= 60