using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Globalization;
using System.Linq;
using System.Numerics;
using System.Runtime.InteropServices.ComTypes;

namespace AtCoderWorkspace
{
    public class Solver
    {
        long[] a;
        int n;
        long ans = 0;
        long ans2 = 0;
        public void Solve()
        {
            var cin = new Scanner();
            n = cin.nextInt();
            a = cin.ArrayLong(n);

            var money = 1000L;
            for (int i = 0; i < n-1; i++)
            {
                //値上がりする寸前を探す
                var now = a[i];
                var after = a[i+1];
                if(now < after)
                {
                    // 値下がりする寸前を探す
                    var max = after;
                    for (int j = i+1; j < n; j++)
                    {
                        var after2 = a[j];
                        if(max > after2 || j == n-1)
                        {
                            // ここで売る
                            i = j-1;
                            var diff = max - now;
                            var count = (money / now);
                            money += (diff * count);
                            break;
                        }
                        else
                        {
                            max = after2;
                        }
                    }
                }
            }

            //dfs(1000, 0,1);
            //dfs2(a[0], 1,1000);
            Console.WriteLine(money);
        }
        long debugCount = 0;

        void dfs2(long pastV, long day, long money)
        {
            if(day == n)
            {
                ans2 = Math.Max(ans2, money);
                return;
            }

            var nowV = a[day];
            if(nowV > pastV)
            {
                var diff = nowV - pastV;
                money += diff * ((pastV / money) + (pastV % money));

                if (day < n - 1)
                {
                    dfs2(a[day + 1], day + 2, money);
                }
            }
            else
            {
                dfs2(pastV, day + 1, money);
            }            
        }

        void dfs(long money, long kabu, int day)
        {
            if (day > n)
            {
                ans = Math.Max(ans, money);
                debugCount++;
                return;
            }

            var kabuka = a[day - 1];

            //買う
            if (money >= kabuka)
            {
                dfs(money % kabuka, money / kabuka, day + 1);
            }

            //売る
            if (kabu >= 0)
            {
                dfs(kabu * kabuka + money, 0, day + 1);
            }

            // 何もしない
            dfs(money, kabu, day + 1);
        }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 27540