Smallest value of n such that an algorithm whose runtime is 100n2 runs faster than an algo whose runtime is 2n

What is the smallest value of n such than an algorithm whose running time is 100n2 runs faster than algorithm whose running time is 2n on the same machine?? This question is related with data and file structures and with algorithm comlexity.