--- /dev/null
+import Data.List (sort)
+
+main :: IO ()
+main = do
+ line1 <- getLine
+ line2 <- getLine
+ let nums = reverse $ sort $ map read $ words line2 :: [Int]
+ print $ solve nums
+
+
+solve (x:xs) = minimum diffs
+ where s = x + sum xs
+ ys = powerSet xs
+ diffs = [abs (s - 2 * (sum y)) | y <- ys]
+
+powerSet :: [a] -> [[a]]
+powerSet [] = [[]]
+powerSet (x:xs) = powerSet xs ++ map (x:) (powerSet xs)