Party Time

Sometimes adding stories makes problems difficult to understand especially if they are hard ones, so here is a problem with simple statements. You are at a party and your friend challenged you to a game of cards. The game goes like this, there are $n$ cards numbered from $1$ to $n$. You have to perform an operation $n$ times. The operation is: - The cards are shuffled and you pick the topmost ca