import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.TreeMap;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		String[] sa = br.readLine().split(" ");
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(sa[i]);
		}
		br.close();

		TreeMap<Integer, Integer> map = new TreeMap<>();
		for (int i = 0; i < n; i++) {
			map.put(a[i], i);
		}

		TreeSet<Integer> set = new TreeSet<>();
		boolean h = false;
		int ans = Integer.MAX_VALUE;
		for (Integer k : map.keySet()) {
			if (set.size() == 0) {
			} else if (set.size() == 1) {
				if (set.last() < map.get(k)) {
					h = true;
				}
			} else {
				if (h && set.last() > map.get(k)) {
					int f = set.pollFirst();
					int v1 = a[f];
					int v2 = a[map.get(k)];
					int v3 = a[set.higher(map.get(k))];
					ans = Math.min(ans, v1 + v2 + v3);
					set.add(f);
				}
				if (!h && set.first() < map.get(k)) {
					int f = set.pollLast();
					int v1 = a[f];
					int v2 = a[map.get(k)];
					int v3 = a[set.lower(map.get(k))];
					ans = Math.min(ans, v1 + v2 + v3);
					set.add(f);
				}
			}
			set.add(map.get(k));
		}
		if (ans == Integer.MAX_VALUE) {
			System.out.println(-1);
		} else {
			System.out.println(ans);
		}
	}
}