const maxn = 1000;
      oo = 1000000000;
var n,i,j: longint;
    f,p: array[0..maxn] of longint;
    dp: array[0..maxn,0..maxn] of longint;
    min: longint;
begin
  readln(n);
  f[0]:=0;
  for i:=1 to n do
  begin
    readln(p[i]);
    if p[i]>100 then f[i]:=f[i-1]+1
    else f[i]:=f[i-1];
  end;
  dp[0,0]:=0;
  for i:=1 to n do
  for j:=0 to f[i] do
  begin
    dp[i,j]:=oo;
    if j<=f[i-1] then dp[i,j]:=dp[i-1,j]+p[i];
    if (dp[i-1,j-1]+p[i]<dp[i,j]) and (p[i]>100) and (j>0) then dp[i,j]:=dp[i-1,j-1]+p[i];
    if (dp[i-1,j+1]<dp[i,j]) and (j<f[i-1]) then dp[i,j]:=dp[i-1,j+1];
  end;
  min:=oo;
  for i:=0 to f[n] do
  if dp[n,i]<min then min:=dp[n,i];
  writeln(min);
end.