Sorting Trouble

//84104971101048411497 - Can you guess what does this mean?
using namespace std;
#include <bits/stdc++.h>
#define mapii map<int, int>
#define debug(a) cout << #a << ": " << a << endl
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define fto(i, l, r) for(int i = (l); i <= (r); ++i)
#define forit(it, type, var) for(type::iterator it = var.begin(); it != var.end(); it++)
#define fordit(rit, type, var) for(type::reverse_iterator rit = var.rbegin(); rit != var.rend(); rit++)
#define ii pair<int, int>
#define iii pair<int, ii>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define ll long long
#define maxN 100005

int n, a[maxN], b[maxN];

bool cmp(int x, int y) {
    return (a[x] <= a[y]);
}

int main () {
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        //freopen("output.txt", "w", stdout);
    #endif // ONLINE_JUDGE

    scanf("%d", &n);
    fto(i, 1, n) {
        scanf("%d", &a[i]);
        b[i] = i;
    }
    sort(b+1, b+n+1, cmp);
    fto(i, 1, n) printf("%d %d\n", b[i], a[i]);
    printf("\n");

    stable_sort(b+1, b+n+1, cmp);
    fto(i, 1, n) printf("%d %d\n", b[i], a[i]);
    printf("\n");

    return 0;
}