Algorithms question: Please help if you can

You have to make pancakes using a skillet that can only hold two pancakes at a time. Each pancake has to be fried on both sides; frying one side of a pancake takes 1 minute, regardless of whether one or two pancakes are fried at the same time. Design an algorithm to do this job in the minimum amount of time and describe itn in words. What is the minimum amount of time as a function of n?