import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
*/public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
static class TaskC   {
public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        }

        int ans = 0;
        int min = 1<<29;
        loop:while (true){
            int idx1 = 0;
            int idx2 = 0;
            while (h[idx1] == 0){
                if(idx1 == N-1 && h[idx1] == 0){
                    break loop;
                }
                idx1++;
                idx2++;
            }
            while (idx2 <= N-1){
                if(h[idx2] == 0){
                    break;
                }
                min = Math.min(min, h[idx2]);
                idx2++;
            }
            for(int i = idx1; i<=idx2-1; i++){
                h[i]-=min;
            }
            ans+=min;
        }
        out.println(ans);
    }

}
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util */public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
static class TaskC   {
public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        }

        int ans = 0;
        int min = 1<<29;
        loop:while (true){
            int idx1 = 0;
            int idx2 = 0;
            while (h[idx1] == 0){
                if(idx1 == N-1 && h[idx1] == 0){
                    break loop;
                }
                idx1++;
                idx2++;
            }
            while (idx2 <= N-1){
                if(h[idx2] == 0){
                    break;
                }
                min = Math.min(min, h[idx2]);
                idx2++;
            }
            for(int i = idx1; i<=idx2-1; i++){
                h[i]-=min;
            }
            ans+=min;
        }
        out.println(ans);
    }

}
} Main public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	} main {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	} InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) TaskC solver = new TaskC(); solver new TaskC() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class TaskC   {
public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        }

        int ans = 0;
        int min = 1<<29;
        loop:while (true){
            int idx1 = 0;
            int idx2 = 0;
            while (h[idx1] == 0){
                if(idx1 == N-1 && h[idx1] == 0){
                    break loop;
                }
                idx1++;
                idx2++;
            }
            while (idx2 <= N-1){
                if(h[idx2] == 0){
                    break;
                }
                min = Math.min(min, h[idx2]);
                idx2++;
            }
            for(int i = idx1; i<=idx2-1; i++){
                h[i]-=min;
            }
            ans+=min;
        }
        out.println(ans);
    }

} TaskC public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        }

        int ans = 0;
        int min = 1<<29;
        loop:while (true){
            int idx1 = 0;
            int idx2 = 0;
            while (h[idx1] == 0){
                if(idx1 == N-1 && h[idx1] == 0){
                    break loop;
                }
                idx1++;
                idx2++;
            }
            while (idx2 <= N-1){
                if(h[idx2] == 0){
                    break;
                }
                min = Math.min(min, h[idx2]);
                idx2++;
            }
            for(int i = idx1; i<=idx2-1; i++){
                h[i]-=min;
            }
            ans+=min;
        }
        out.println(ans);
    } solve {
        int N = in.nextInt();
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        }

        int ans = 0;
        int min = 1<<29;
        loop:while (true){
            int idx1 = 0;
            int idx2 = 0;
            while (h[idx1] == 0){
                if(idx1 == N-1 && h[idx1] == 0){
                    break loop;
                }
                idx1++;
                idx2++;
            }
            while (idx2 <= N-1){
                if(h[idx2] == 0){
                    break;
                }
                min = Math.min(min, h[idx2]);
                idx2++;
            }
            for(int i = idx1; i<=idx2-1; i++){
                h[i]-=min;
            }
            ans+=min;
        }
        out.println(ans);
    } int N = in.nextInt(); N in.nextInt() in.nextInt in int h[] = new int[N]; h new int[N] N for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            h[i] = in.nextInt();
        } {
            h[i] = in.nextInt();
        } h[i] = in.nextInt() h[i] h i in.nextInt() in.nextInt in int ans = 0; ans 0 int min = 1<<29; min 1<<29 1 29 out.println(ans) out.println out ans int testNumber testNumber Scanner in in PrintWriter out out */public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
static class TaskC   {
public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        }

        int ans = 0;
        int min = 1<<29;
        loop:while (true){
            int idx1 = 0;
            int idx2 = 0;
            while (h[idx1] == 0){
                if(idx1 == N-1 && h[idx1] == 0){
                    break loop;
                }
                idx1++;
                idx2++;
            }
            while (idx2 <= N-1){
                if(h[idx2] == 0){
                    break;
                }
                min = Math.min(min, h[idx2]);
                idx2++;
            }
            for(int i = idx1; i<=idx2-1; i++){
                h[i]-=min;
            }
            ans+=min;
        }
        out.println(ans);
    }

}
} */public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
static class TaskC   {
public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        }

        int ans = 0;
        int min = 1<<29;
        loop:while (true){
            int idx1 = 0;
            int idx2 = 0;
            while (h[idx1] == 0){
                if(idx1 == N-1 && h[idx1] == 0){
                    break loop;
                }
                idx1++;
                idx2++;
            }
            while (idx2 <= N-1){
                if(h[idx2] == 0){
                    break;
                }
                min = Math.min(min, h[idx2]);
                idx2++;
            }
            for(int i = idx1; i<=idx2-1; i++){
                h[i]-=min;
            }
            ans+=min;
        }
        out.println(ans);
    }

}
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
*/public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
static class TaskC   {
public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int h[] = new int[N];
        for (int i=0; i<N; i++) {
            h[i] = in.nextInt();
        }

        int ans = 0;
        int min = 1<<29;
        loop:while (true){
            int idx1 = 0;
            int idx2 = 0;
            while (h[idx1] == 0){
                if(idx1 == N-1 && h[idx1] == 0){
                    break loop;
                }
                idx1++;
                idx2++;
            }
            while (idx2 <= N-1){
                if(h[idx2] == 0){
                    break;
                }
                min = Math.min(min, h[idx2]);
                idx2++;
            }
            for(int i = idx1; i<=idx2-1; i++){
                h[i]-=min;
            }
            ans+=min;
        }
        out.println(ans);
    }

}
}

