#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> arr;
vector<int> ans;
vector<vector<int>> S;
int minK = INT_MAX;
vector<int> bans;
bool check(const vector<int>& s) {
    if (s.size() < 2) return false;
    bool inc = true, dec = true;
    for (int i = 1; i < s.size(); i++) {
        if (s[i] < s[i-1]) inc = false;
        if (s[i] > s[i-1]) dec = false;
    }
    return inc || dec;
}
void dfs(int idx, int k) {
    if (k >= minK) return; 
    if (idx == n) {
        for (const auto& s : S) {
            if (s.size() < 2 || !check(s)) return;
        }
        if (k < minK) {
            minK = k;
            bans = ans;
        }
        return;
    }
    for (int i = 0; i < S.size(); i++) {
        if (!S[i].empty()) {
            S[i].push_back(arr[idx]);
            if (check(S[i])) {
                int old = ans[idx];
                ans[idx] = i + 1;
                dfs(idx + 1, k);
                ans[idx] = old;
            }
            S[i].pop_back();
        }
    }
    if (S.size() < n / 2) {
        S.push_back({arr[idx]});
        ans[idx] = S.size();
        dfs(idx + 1, S.size());
        S.pop_back();
        ans[idx] = 0;
    }
}
int main() {
    cin >> n;
    arr.resize(n);
    ans.resize(n, 0);
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    if (n < 2) {
        cout << 0 << endl;
        return 0;
    } 
    S.clear();
    dfs(0, 0);
    if (minK == INT_MAX) {
        cout << 0 << endl;
    } else {
        cout << minK << endl;
        for (int i = 0; i < n; i++) {
            cout << arr[i] << " " << bans[i] << endl;
        }
    }
    return 0;
}