Some one help in this question?

Suppose an implementation of Algorithm A and Algorithm B on the same machine requires 8n2 steps and 64nlg n steps respectively, where n is input size. Find the values of n, where insertion sort beats merge sort.