import std.algorithm;
import std.array;
import std.ascii;
import std.container;
import std.conv;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
void log(A...)(A arg) { stderr.writeln(arg); }
int size(T)(in T s) { return cast(int)s.length; }

void main() {
    auto N = readln.chomp.to!int;
    auto S = readln.chomp.split(" ").map!(to!int).array;
    auto f = new int[][](N + 1, S[N] + 1);
    int A = S[N];
    foreach (ref L; f) L[] = int.max / 2;
    f[0][0] = 1;
    for (int n = 0; n <= N; n++) {
        for (int a = 0; a <= S[n]; a++) {
            if (n >= 1) f[n][a] = min(f[n][a], f[n - 1][a] + 1);
            for (int j = 0; j <= a - 1; j++) {
                f[n][a] = min(f[n][a], f[n][j] + f[n][a - j - 1]);
            }
        }
    }
    writefln("%(%s %)", f[N]);
    //log(f.map!(to!string).join("\n"));
}