Three eggs, nine drops

You have $3$ identical eggs and a building of $n$ floors. There is a threshold floor $X$ such that an egg dropped from floor $X$ or above breaks, and from below $X$ survives. Using an optimal strategy, what is the largest $n$ for which you can always determine $X$ in at most $9$ drops (worst case)?