#include <iostream>
#include <algorithm>
using namespace std;
 
pair<int, int> t[1001];
 
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		int a;
		cin>>a;
		t[i] = make_pair(a, i);
	}
	// use block-sort if needed
	int len = 0;
	for (int i = n; i >= 1; i--) {
		if (t[i].first != t[i - 1].first) {
			len++;
		} else {
			swap(t[i], t[i + len]);
		}
	}
	sort(t + 1, t + 1 + len);
	for (int i = 1; i <= n; i++) {
		cout<<"("<<t[i].first<<", "<<t[i].second<<") ";
	}
	cout<<endl;
}