Tessellate S.T.E.M.S - Computer Science - College - Set 2 - Problem 2

We call a permutation $\pi$ of $\{1,2,\cdots,n\}$ good if it satisfies the following property: There does not exist three numbers $i_1 < i_2 < i_3$ s.t. $\pi(i_1) > \pi(i_2) > \pi(i_3)$ .

Report the number of good permutations for the set $\{1,2,\cdots,10\}$ .

This problem is a part of Tessellate S.T.E.M.S.