import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static long MOD = (long) (Math.pow(10, 9) + 7);
	public static Scanner sc = new Scanner(System.in);

	static long kabu;
	static long kane;

	public static void main(String[] args) {

		int n = ni();
		//		int n = 80;
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = ni();
		}
		//		for (int i = 0; i < n; i += 2) {
		//			a[i] = 100;
		//		}
		//		for (int i = 1; i < n; i += 2) {
		//			a[i] = 200;
		//		}

		kabu = 0l;
		kane = 1000l;

		for (int i = 0; i < n - 1; i++) {
			if (a[i] < a[i + 1]) {
				buy(kane, a[i]);
			} else {
				uru(a[i]);
			}
			//			debug();
			//			out(kane);
			//			out(kabu);
			//			debug();
		}

		uru(a[n - 1]);

		out(kane);

	}

	static void buy(long shojimoney, long kabumoney) {
		long pluskabu = shojimoney / kabumoney;
		kabu += pluskabu;
		kane -= pluskabu * kabumoney;
	}

	static void uru(long kabumoney) {
		kane += kabu * kabumoney;
		kabu = 0;
	}

	static int popcount(int n) {
		return Long.bitCount(n);
		//		for (;;) {
		//			n /= 2;
		//			debug("popcount:" + n);
		//			count++;
		//			if (n == 0) {
		//				out("popcountres=" + count);
		//				break;
		//
		//			}
		//		}
	}

	static int f(int n) {
		int count = 0;
		for (;;) {
			n = n % popcount(n);
			count++;
			if (n == 0) {
				break;
			}
		}
		return count;
	}

	/*
	 * 以下メソッド集
	 */
	static char[][] same(char[][] c, int h, int w) {
		char[][] a = new char[h][w];
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				a[i][j] = c[i][j];
			}
		}
		return a;

	}

	static int countkuro(char[][] c) {
		int count = 0;
		for (char[] cc : c) {
			for (char ccc : cc) {
				if ('#' == ccc) {
					count++;
				}
			}
		}
		return count;
	}

	static double[] sort(double[] r) {
		Arrays.sort(r);
		return r;
	}

	static void debug() {
		out("---");
	}

	static void debug(long a) {
		out("-------");
		out(a);
		out("-------");
	}

	static void debug(String a) {
		out("-------");
		out(a);
		out("-------");
	}

	static long[] sort(long[] n) {
		Arrays.sort(n);
		return n;
	}

	static int ketasuu(int n) {
		String str = "" + n;
		return str.length();
	}

	static int account(String str) {
		String target = "1";
		int count = 0;
		int len = str.length();
		for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		}
		return count;
	}

	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static double nd() {
		return sc.nextDouble();
	}

	static String n() {
		return sc.next();
	}

	static char[] nc() {
		return sc.next().toCharArray();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}

	static void out(char info) {
		System.out.println(info);
	}

	static void out(Object obj) {
		System.out.println(obj.toString());
	}

	static void outn(String info) {
		System.out.print(info);
	}

	static void outn(int info) {
		System.out.print(info);
	}

	static void outn(double info) {
		System.out.print(info);
	}

	static void outn(long info) {
		System.out.print(info);
	}

	static void outn(char info) {
		System.out.print(info);
	}

	static double max(double d, double e) {
		return Math.max(d, e);
	}

	static long max(long a, long b) {
		return Math.max(a, b);
	}

	static long min(long d, long e) {
		return Math.min(d, e);
	}

	static int min(int a, int b) {
		return (int) Math.min(a, b);
	}
}

class XY {
	int h;
	int c;

	XY(int h, int c) {
		this.h = h;
		this.c = c;
	}
}


Measured memory_bytes: 35772