We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.

In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its weight is {\rm min}(A_x,B_y).

We will consider a directed cycle in this graph that visits every vertex exactly once. Find the minimum total weight of the edges in such a cycle.

Constraints

* 2 \leq N \leq 10^5
* 1 \leq A_i \leq 10^9
* 1 \leq B_i \leq 10^9
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 B_1
A_2 B_2
:
A_N B_N


Output

Print the minimum total weight of the edges in such a cycle.

Examples

Input

3
1 5
4 2
6 3


Output

7


Input

4
1 5
2 6
3 7
4 8


Output

10


Input

6
19 92
64 64
78 48
57 33
73 6
95 73


Output

227
import java.io.*;
import java.util.*;
 
public class Main {
	static final Reader in = new Reader();
	
	public static void main(String[] args) {
		int n=in.nextInt();
		Pair[] p = new Pair[2*n];
		long[] a = new long[2];
		for(int i=0; i<2*n; ++i) {
			p[i] = new Pair(in.nextInt(), i);
			a[i&1]+=p[i].a;
		}
		a[0]=Math.min(a[1], a[0]);
		a[1]=0;
		Arrays.sort(p, new Comparator<Pair>() {
			public int compare(Pair a, Pair b) {
				return a.a==b.a?a.b-b.b:a.a-b.a;
			}
		});
		int[] q = new int[2*n];
		for(int i=0; i<n; ++i)
			a[1]+=p[i].a;
		for(int i=0; i<2*n; ++i)
			q[p[i].b]=i;
		for(int i=0; i<n; ++i) {
			long c=a[1];
			int j=n;
			while(j-(q[2*i]<j?1:0)-(q[2*i+1]<j?1:0)<n)
				c+=p[j++].a;
			for(int k=2*i; k<2*i+2; ++k)
				if(q[k]<j)
					c-=p[q[k]].a;
			a[0]=Math.min(c, a[0]);
		}
		System.out.println(a[0]);
	}
	
	static class Pair {
		int a, b;
		Pair(int a, int b) {
			this.a=a;
			this.b=b;
		}
	}
	
	static class Reader {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		String next() {
			while(st==null||!st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch(Exception e) {}
			}
			return st.nextToken();
		}
		int nextInt() {
			return Integer.parseInt(next());
		}
	}
}