You have 2020 piles of coins in front of you. The first pile contains 1 coin, the second pile contains 2 coins, the third pile contains 3 coins, and so on. Therefore, the 2020th pile contains 2020 coins. Guess a positive integer $k$, such that the piles contain at least $k$ coins. Take away exactly $k$ coins from these piles. Find the minimum number of turns you need to take away all of these coins.

Let's think step by step and output the final answer within \boxed{}.
user