There are n cities numbered from 1 to n, and city i has beauty a_i.

A salesman wants to start at city 1, visit every city exactly once, and return to city 1.

For all i≠ j, a flight from city i to city j costs max(c_i,a_j-a_i) dollars, where c_i is the price floor enforced by city i. Note that there is no absolute value. Find the minimum total cost for the salesman to complete his trip.

Input

The first line contains a single integer n (2≤ n≤ 10^5) — the number of cities.

The i-th of the next n lines contains two integers a_i, c_i (0≤ a_i,c_i≤ 10^9) — the beauty and price floor of the i-th city.

Output

Output a single integer — the minimum total cost.

Examples

Input


3
1 9
2 1
4 1


Output


11


Input


6
4 2
8 4
3 0
2 3
7 1
0 1


Output


13

Note

In the first test case, we can travel in order 1→ 3→ 2→ 1. 

  * The flight 1→ 3 costs max(c_1,a_3-a_1)=max(9,4-1)=9. 
  * The flight 3→ 2 costs max(c_3, a_2-a_3)=max(1,2-4)=1. 
  * The flight 2→ 1 costs max(c_2,a_1-a_2)=max(1,1-2)=1. 



The total cost is 11, and we cannot do better.
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {

	class Element implements Comparable<Element>{
		int _a, _c, _id;
		public Element(int a, int c, int id) {
			_a = a;
			_c = c;
			_id = id;
		}
		long distance() {
			return _a + _c;
		}
		@Override
		public int compareTo(Element e) {
			return _a - e._a;
		}
		@Override
		public String toString() {
			return "(" + _id + ")[" + _a + ", " + _c + "]";
		}
	}
	Element m[];
	void run() throws Exception {
		int n = nextInt();
		m = new Element[n];
		long answer = 0;
		for(int i = 0; i < n; i++) {
			m[i] = new Element(nextInt(), nextInt(), i + 1);
			answer += m[i]._c;
		}
		Arrays.sort(m);
		int pos = 0;
		for(int i = 0; i < n; i++) {
			if (m[pos].distance() < m[i].distance() || (i == n - 1)) {
				answer += Math.max(m[i]._a - m[pos].distance(), 0);
				pos = i;
			}
		}
		out.println(answer);
//		System.out.println(Arrays.toString(m));
	}

	public static void main(String[] args) throws Exception {
		Main instance = new Main();
		instance.initStreams();
		instance.run();
		instance.closeStreams();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer st = new StringTokenizer("");

	void initStreams() throws FileNotFoundException {
		if (new File("input.txt").exists()) {
			try {
				System.setIn(new FileInputStream("input.txt"));
			} catch (FileNotFoundException e1) {
				e1.printStackTrace();
			}
		}
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
	}

	void closeStreams() throws IOException {
		in.close();
		out.close();
	}

	String nextString() throws IOException {
		while (!st.hasMoreTokens())
			st = new StringTokenizer(in.readLine());
		return st.nextToken();
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextString());
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextString());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextString());
	}
}
