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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100000;
int n;
ll a[maxn + 10], b[maxn + 10], sa, sb, ans, tot;
bool vis[maxn * 2 + 10];
struct node {
	int id; ll v;
	bool operator < (const node &t) const {
		return v < t.v;
	}
}c[maxn * 2 + 10];

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld%lld", &a[i], &b[i]);
		sa += a[i]; sb += b[i];
		c[i * 2 - 1] = (node){i * 2 - 1, a[i]};
		c[i * 2] = (node){i * 2, b[i]};
	}
	ans = min(sa, sb);
	sort(c + 1, c + n * 2 + 1);
	for (int i = 1; i <= n - 2; ++i) {
		tot += c[i].v; vis[c[i].id] = 1;
	}
	for (int i = 1; i <= n; ++i) {
		ll now = tot + a[i] + b[i];
		int cnt = n - 2;
		if (vis[i * 2 - 1]) {
			now -= a[i]; 
			++cnt;
			if (c[cnt].id == i * 2 || c[cnt].id == i * 2 - 1) ++cnt;
			now += c[cnt].v;
		}
		if (vis[i * 2]) {
			now -= b[i]; 
			++cnt;
			if (c[cnt].id == i * 2 || c[cnt].id == i * 2 - 1) ++cnt;
			now += c[cnt].v;
		}
		ans = min(ans, now);
	}
	printf("%lld", ans);
}
