import Data.List

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

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