If n is an integer, then the first of the 2012 distinct ways is (n+1)*n. The 2012th way is (n+2012)*(n-2011). This must be greater then n*n. The next pair, (n*2013)*(n-2012) must be less than or equal to n*n.

In other words,

(n+2012)(n-2011) > n*n >= (n+2013)*(n-2012)

Multiplying.

n*n + n - 2011*2012 > n*n >= n*n + n - 2012*2013

Simplifying,

2011*2012 < n <= 2012*2013

Multiplying,

4046132 < n <= 4050156

So, if n is an integer. then its minimum value is is 4046133 and its maximum is 4050156.

/************************************************/

BUT, if n is not an integer, then it must be .5 + an integer. The first of the 2012 distinct ways is (n+.5)*(n+.5). The 2012th way is (n+2011.5)*(n-2010.5). This must be greater then n*n. The next pair, (n*2012.5)*(n-2011.5) must be less than or equal to n*n.

In other words,

(n+2011.5)*(n-2010.5) > n*n >= (n+2012.5)*(n-2011.5)

Simplifying, 4044120.75 < n <= 4048143.75

So, if n is not an integer, then its minimum value is
4,044,121.5 and its maximum value is
4,048,143.5

/*************************************************/

Combining the two results, we get:

Minimum n: 4,044,121.5

Maximum n:
4,050,156

I also agree with Broll that this is definitely not a difficulty 2 problem, at least not if interpreted literally. And I am clearly feeling literal today.