1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;

ii P[50005];

bool ccw(ii a, ii b, ii c) { return (ll)(b.f - a.f) * (c.s - a.s) - (ll)(c.f - a.f) * (b.s - a.s) > 0; }

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int N; cin >> N;
	for (int i = 0; i < N; ++i) cin >> P[i].f >> P[i].s;
	int m = min_element(P, P + N) - P;
	vector<pair<double, int>> A;
	for (int i = 0; i < N; ++i) {
		if (i != m) A.emplace_back(atan2(P[i].s - P[m].s, P[i].f - P[m].f), i);
	}
	sort(begin(A), end(A));
	vector<int> S;
	vector<ii> ans;
	for (int i = 0; i < A.size(); ++i) {
		ans.emplace_back(m, A[i].s);
		while (i) {
			ans.emplace_back(A[i].s, S.back());
			if (S.size() <= 1 || ccw(P[A[i].s], P[S[S.size() - 2]], P[S.back()])) break;
			else S.pop_back();
		}
		S.push_back(A[i].s);
	}
	cout << 3 * N - 2 * S.size() - 4 << ' ' << ans.size() << '\n';
	for (auto& p : ans) cout << p.f + 1 << ' ' << p.s + 1 << '\n';
}