Make BST using n int.

def countUniqueBST(n):

    if n <= 1:

        return 1

    dp = [0] * (n + 1)

    dp[0] = 1

    dp[1] = 1

    for i in range(2, n + 1):

        for j in range(1, i + 1):

            dp[i] += dp[j - 1] * dp[i - j]

    return dp[n]

n = 5

num_bst = countUniqueBST(n)

print("Number of Unique BSTs:", num_bst)