An algorithm starts with a single square and on each of its next iterations adds new squares all around the outside as shown below.

                                               S    
                            S                S S S 
           S              S S S            S S S S S
                            S                S S S
                                               S
         n = 1            n = 2              n = 3          

How many unit squares will there be after the nth iteration?