*triangular number* is one that can be expressed as the sum of the first $n$ consecutive integers, $1 + 2 + 3 + \cdots + n$, for some $n$. Below, the first several triangular numbers are listed:
$$1, 3, 6, 10, 15, 21, 28, 36, \ldots$$
Notice, both $1$ and $36$ are triangular numbers which are also perfect squares. Write a class named `TriangularSquareFinder`

whose main method prompts the user for some number $n$, and then finds and displays all triangular numbers which are also perfect squares that are less than $n$.