Conditional Probability, Independence & Bayes · Challenge problem

A jar contains many coins: $\tfrac1{10}$ of them are biased and land heads with probability $\tfrac34$, and the rest are fair. A coin is drawn at random from the jar and flipped $n$ times, landing heads every time. What is the smallest $n$ for which it is then more likely than not that the coin is biased?