Runnig time on algorithm

Question

What is the smallest value of $n$ (where $n$ is a natural number) such that an algorithm whose running time is $100\sqrt{n}$ runs faster than an algorithm whose running time is $2^{\frac{n}{2}}$ on the same machine?

Comments

18. 

100 √n < 2^n/2

10000 n < 2ⁿ

10000 < 2ⁿ/n