Problem Statement  
The elevator in your house is broken, so you need to use stairs to get to different places. Now you want to know how long it will take to get from one location in your house to another one.
You will be given the plan of your house as a String[]. All elements with even indices (elements 0, 2, 4, ...) will represent the floors of the building. Each '#' character represents a piece of the floor, and the characters 'S' and 'F' represent your starting position and your destination, respectively. All elements with odd indices will represent the area between floors. The '' character represents a set of stairs, and the '.' character represents an empty space. You can only move from one floor to another floor by going up or down a set of stairs. There will only be one set of stairs between each pair of consecutive floors. You spend one second to move one floor down, two seconds to move one step left or right and three seconds to move one floor up. You are to return the minimal time you need to get from the starting position to the finish.
For example, for the following plan:
#S### .... ##### .... ####F the optimal path will consist of two steps to the right, moving 1 floor down, two steps to the left, moving 1 floor down and finally three steps to the right. The total time spent is 2*2 + 1*1 + 2*2 + 1*1 + 3*2 = 16 seconds. First element represents the topmost floor.  
Definition  
 
Constraints  
  plan will contain between 1 and 49 elements, inclusive.  
  plan will contain an odd number of elements.  
  Each element of plan will contain between 1 and 50 characters, inclusive.  
  Each element of plan will contain the same number of characters.  
  Elements of plan with even indices (0based) will contain only the characters '#', 'S', and 'F'.  
  Elements of plan with odd indices will contain only the characters '.' and ''.  
  Each element of plan with an odd index will contain exactly one ''.  
  plan will contain exactly one 'S' and exactly one 'F'.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
 
4)  
 
5)  
