Balanced BST

Given a sorted array of numbers in the range $[1,1023]$ such as $1,2,...,1023$ were inserted into a BST$,$ resulting in its height of $10.$ What is the smallest number among the first seven numbers inserted?

Note: Height of the root node is assumed to be $1.$