Each of 2010 boxes in a line contains one red marble, and for 1≤k≤2010, the box in the kth position also contains k white marbles. Ram begins at the first box and successively draws a single marble at random from each box, in order. He stops when he first draws a red marble. Let P(n) be the probability that he stops after drawing exactly n marbles. Then the possible value(s) of n for which P(n)<12010, is