public static int runningTime(List<Integer> arr) {
    // Write your code here
        int n = arr.size();
        int noOfShifts = 0;
        
        for(int i=0; i<n-1; i++){
            int first = arr.get(i);
            int second = arr.get(i+1);
            if(first > second){
                arr.set(i, second);
                arr.set(i+1, first);
                noOfShifts++;
                if(i-1 > -1){ i-=2; }
            }
        }
        return noOfShifts;
    }

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, i;
    cin>>n;
    vector<int>v(n), v2(n); 
    int count = 0;
    for (i=0;i<n;i++){
        cin >> v[i];
        v2[i] = v[i];
    }
    sort(v2.begin(),v2.end());
    while (v != v2){
        for (i=0;i<n;i++){
            if (v[i] > v[i+1]){
                swap(v[i],v[i+1]);
                count++;
                break;
            }
        } 
    }  
    cout << count;
    return 0;
}

public static int runningTime(ArrayList<Integer> a) {
        int count = 0;
        for (int i = 1; i < a.size(); i++) {
            if (a.get(i) < a.get(i - 1)) {
                int temp = a.get(i);
                a.set(i, a.get(i - 1));
                a.set(i - 1, temp);
                count++;
                i = 0;
            }
        }
        return count;
    }

public static int runningTime(List<Integer> list) {
    // Write your code here
        int count = 0;
        for (int i = 0; i < list.size() - 1; i++){
            for (int j = i + 1; j > 0; j--){
                if (list.get(j - 1) > list.get(j)){
                    swap(list, j-1, j);
                    count++;
                }
                else break;
            }
        }
        return count;
    }

    private static void swap(List<Integer> list, int a, int b) {
        Collections.swap(list, a, b);
    }

    public static int runningTime(List<Integer> arr) {
    int counter=0;
    
    //convert arraylist arr to array 
    Integer[] array = new Integer[arr.size()]; 
    arr.toArray(array);
    
    //sorting the array 
    for(int i = 1; i < array.length; i++){
            int a = array[i];
            int j = i - 1;
            while(j >= 0 && array[j] > a){
                array[j + 1] = array[j];
                //add value to counter in each iteration
                counter=counter+1;
                j--;                
            }
            array[j + 1] = a;
        }
        return counter;
    }