import java.util.Scanner;

public class Main {
    static Scanner sc = new Scanner(System.in);
    static int n;
    static int a[];
    static int answer = -1000000000;
    static int minv;


    public static void main(String[] args) {
        read();
        solve();
        System.out.println(answer);
    }

    public static void read() {
        n = sc.nextInt();
        a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }
        minv = a[0];

    }

    public static void solve() {
        for (int i = 1; i < n; i++) {
            if (a[i] - minv > answer) {
                answer = a[i] - minv;
            }
            if (minv > a[i]) {
                minv = a[i];
            }
        }
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz