import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001L;

void main() {
    int n;
    scan(n);
    auto a = readln.split.to!(long[]);
    a = [inf] ~ a ~ [-inf];

    long mon = 1000;
    long kb = 0;

    foreach (i; 1 .. n + 1) {
        if (a[i - 1] >= a[i] && a[i] < a[i + 1]) {
            int t = (mon / a[i]);
            mon = mon - t * a[i];
            kb += t;
        }
        else if (a[i - 1] <= a[i] && a[i] > a[i + 1]) {
            mon += kb * a[i];
            kb = 0;
        }
    }

    writeln(mon);
}

void scan(T...)(ref T args) {
    auto line = readln.split; // @suppress(dscanner.suspicious.unmodified)
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args)
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args)
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    return isChanged;
}

void yes(bool ok, string y = "Yes", string n = "No") {
    return writeln(ok ? y : n);
}
