You are given N integers A_1, A_2, ..., A_N.

Consider the sums of all non-empty subsequences of A. There are 2^N - 1 such sums, an odd number.

Let the list of these sums in non-decreasing order be S_1, S_2, ..., S_{2^N - 1}.

Find the median of this list, S_{2^{N-1}}.

Constraints

* 1 \leq N \leq 2000
* 1 \leq A_i \leq 2000
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 A_2 ... A_N


Output

Print the median of the sorted list of the sums of all non-empty subsequences of A.

Examples

Input

3
1 2 1


Output

2


Input

1
58


Output

58
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author prakharjain
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        agc020c solver = new agc020c();
        solver.solve(1, in, out);
        out.close();
    }

    static class agc020c {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();

            int[] a = new int[n];

            int ts = 0;
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
                ts += a[i];
            }

            if (n == 1) {
                out.println(a[0]);
                return;
            }

            int clsz = (ts + 64) / 64;

            long[][] dp = new long[2][clsz];

            dp[0][0] = (1l << 63);
            dp[0][a[0] / 64] |= (1l << (63 - (a[0] % 64)));

            for (int i = 1; i < n; i++) {
                for (int j = 0; j < clsz; j++) {
                    dp[1][j] = dp[0][j];
                }

                long[] clone = dp[0];

                int words = (a[i] + 63) / 64;

                long[] newclone = new long[clsz + 1];

                for (int j = words; j <= clsz; j++) {
                    newclone[j] = clone[j - words];
                }

                if (words * 64 > a[i]) {
                    long diff = words * 64 - a[i];

                    long mask = ((1l << diff) - 1) << (64 - diff);
                    for (int j = words - 1; j < clsz; j++) {
                        newclone[j] <<= diff;
                        newclone[j] |= ((newclone[j + 1] & mask) >>> (64 - diff));
                    }
                }

                for (int j = 0; j < clsz; j++) {
                    dp[1][j] |= newclone[j];
                }

                int sum = (ts + 1) / 2;

                if (i == n - 1) {
                    for (int j = sum; j <= ts; j++) {
                        if ((dp[1][j / 64] & ((1l << (63 - (j % 64))))) != 0) {
                            out.println(j);
                            return;
                        }
                    }
                }

                for (int j = 0; j < clsz; j++) {
                    dp[0][j] = dp[1][j];
                }
            }
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(int i) {
            writer.println(i);
        }

    }
}

