# import sys
import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
    # combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce

mod = int(1e9+7)
# mod = 998244353
INF = 1<<50

def readInt():
    return list(map(int,input().split()))

def main():
    n = int(input())
    a = readInt()
    money = 1000
    stake = 0
    for i in range(n-1):
        if a[i]<a[i+1]:
            stake = money // a[i]
            money -= a[i] * stake
        else:
            money += a[i] * stake
            stake = 0
    money += a[-1] * stake
    print(money)
    return

if __name__=='__main__':
    main()
