finding the intersection of two equations where one is N^C and the other is C^N

Question

Algorithm A is 1000 * n^2 and algorithm B is 2^n. When do they intersect? I.e., when does algorithm A become more efficient?

1000 * n^2 = 2^n

solve for n