using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        var A = cin.scanint;
        int sum = A.Sum();
        int x = sum / 2;

        var can = new BitSet(x + 1);

        can[0] = true;
        foreach (var i in A)
        {
            can |= can << i;
        }

        while (!can[x]) x--;

        WriteLine(sum - x);
    }

}

/// <OriginalAuthor>riantkb</OriginalAuthor>
class BitSet
{
    int size;
    ulong[] bits;
    public BitSet(int n)
    {
        size = n;
        bits = new ulong[(n + 63) >> 6];
    }
    public BitSet(IList<bool> b) : this(b.Count)
    {
        for (int i = 0; i < size; i++)
            this[i] = b[i];
    }
    public void fill(bool b)
    {
        for (int i = 0; i < bits.Length; i++) bits[i] = b ? ulong.MaxValue : 0;
        trim();
    }
    public bool this[int i]
    {
        set
        {
            if (value) bits[i >> 6] |= 1UL << (i & 63);
            else bits[i >> 6] &= ~(1UL << (i & 63));
        }
        get
        {
            return (bits[i >> 6] >> (i & 63) & 1) == 1;
        }
    }
    void trim()
    {
        if ((size & 63) > 0) bits[bits.Length - 1] &= (1UL << (size & 63)) - 1UL;
    }

    public static BitSet operator &(BitSet a, BitSet b)
    {
        var ret = new BitSet(a.size);
        for (int i = 0; i < ret.bits.Length; i++) ret.bits[i] = a.bits[i] & b.bits[i];
        return ret;
    }
    public static BitSet operator |(BitSet a, BitSet b)
    {
        var ret = new BitSet(a.size);
        for (int i = 0; i < ret.bits.Length; i++) ret.bits[i] = a.bits[i] | b.bits[i];
        return ret;
    }
    public static BitSet operator ^(BitSet a, BitSet b)
    {
        var ret = new BitSet(a.size);
        for (int i = 0; i < ret.bits.Length; i++) ret.bits[i] = a.bits[i] ^ b.bits[i];
        return ret;
    }
    public static BitSet operator <<(BitSet a, int k)
    {
        if (k < 0) return a >> -k;
        var ret = new BitSet(a.size);
        for (int i = k >> 6; i < ret.bits.Length; i++)
            ret.bits[i] = a.bits[i - (k >> 6)] << (k & 63) | (i > (k >> 6) && (k & 63) != 0 ? a.bits[i - 1 - (k >> 6)] >> 64 - (k & 63) : 0);
        ret.trim();
        return ret;
    }
    public static BitSet operator >>(BitSet a, int k)
    {
        if (k < 0) return a << -k;
        var ret = new BitSet(a.size);
        for (int i = 0; i + (k >> 6) < ret.bits.Length; i++)
            ret.bits[i] = a.bits[i + (k >> 6)] >> (k & 63) | (i + (k >> 6) < ret.bits.Length - 1 && (k & 63) != 0 ? a.bits[i + 1 + (k >> 6)] << 64 - (k & 63) : 0);
        return ret;
    }
    public BitSet Lrotate(int k) => this << k | this >> (size - k);
    public BitSet Rrotate(int k) => this >> k | this << (size - k);

    public static bool operator ==(BitSet a, BitSet b)
    {
        for (int i = 0; i < a.bits.Length; i++) if (a.bits[i] != b.bits[i]) return false;
        return true;
    }
    public static bool operator !=(BitSet a, BitSet b)
    {
        return !(a == b);
    }

    public bool[] ToBoolean()
    {
        var ret = new bool[size];
        for (int i = 0; i < size; i++) ret[i] = this[i];
        return ret;
    }
    public override string ToString()
    {
        var sb = new SB(size);
        for (int i = 0; i < size; i++) sb.Append(this[i] ? '1' : '0');
        return sb.ToString();
    }

    public override bool Equals(object p)
    {
        var b = (BitSet)p;
        for (int i = 0; i < bits.Length; i++) if (bits[i] != b.bits[i]) return false;
        return true;
    }
    public override int GetHashCode() => bits.GetHashCode();
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 30536