A complete binary tree which is also a binary search tree contains 500 elements. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 2nd largest element of the tree is stored at index ______________.