Eleven pirates find a treasure chest. When they divide the coins among themselves, there are 5 coins left. They throw one pirate overboard and divide the coins again, only to find that there are 3 coins left over. They throw another pirate overboard and divide the coins again. This time, the coins divide evenly. 

What is the least number of coins there could have been?

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