Recurrence sequence

Consider the sequence $t(n)$ defined by the following recurrence.

• $t(0) = 1$
• $t(n) = t(0)t(n-1) + t(1)t(n-2) + \cdots + t(n-1)t(0)$ for $n \ge 1$

Applying the definition directly gives $t(1) = t(0)t(0) = 1$, $t(2) = t(0)t(1) + t(1)t(0) = 2$, and $t(3) = t(0)t(2) + t(1)t(1) + t(2)t(0) = 5$.

Given an integer $n$, write a program that prints $t(n)$.

The first line contains an integer $n$ ($0 \le n \le 35$).

Print $t(n)$ on the first line. Every value up to $t(35)$ fits in a signed 64-bit integer.