#ifdef LOCAL111 #else #define NDEBUG #endif #include const int INF = 1e8; using namespace std; #define endl '\n' #define ALL(a) (a).begin(),(a).end() #define SZ(a) int((a).size()) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) #define RBP(i,a) for(auto& i : a) #ifdef LOCAL111 #define DEBUG(x) cout<<#x<<": "<<(x)< void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;} template bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;} template bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;} typedef pair P; typedef long long int LL; typedef unsigned long long ULL; typedef pair LP; void ios_init(){ //cout.setf(ios::fixed); //cout.precision(12); #ifdef LOCAL111 return; #endif ios::sync_with_stdio(false); cin.tie(0); } int main() { ios_init(); int n; cin >> n; vector a(n); REP(i,n) cin >> a[i]; int m = 0; std::vector u, v; REP(i,n){ REP(j,n){ if(a[i] > a[j]){ swap(a[i], a[j]); m++; u.push_back(i); v.push_back(j); } } } cout << m << endl; REP(i,m) cout << u[i] << ' ' << v[i] << endl; int suu; cin >> suu; return 0; }