import Data.List

solve :: [Int] -> Bool
solve xs
  | minimum xs == 1    = odd $ sum xs - length xs
  | length xs - p == 1 = not $ solve $! map (`div` q) ys
  | otherwise          = odd p
  where p = length $ filter even xs
        q = foldl1' gcd ys
        ys = map (\x -> if odd x then x - 1 else x) xs

main :: IO ()
main = do
  _ <- getLine
  a <- getLine
  putStrLn $ (\x -> if solve x then "First" else "Second") $ map read $ words a
