Invert

import java.util.Collections;
import java.util.LinkedList;

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author viljampa
 */
public class kilpa22 {

    public static void main(String[] args) {
        IO io = new IO();
        LinkedList<Integer> lista = new LinkedList();
        int montako = io.nextInt();
        int inversio = 0;
        int inversiot = 0;
//        int montako = 4;
//        lista.add(2);
//        lista.add(6);
//        lista.add(3);
//        lista.add(1);
//        lista.add(1);
//        Collections.sort(lista);        
//        for (int i = 0; i < montako; i++) {
//            System.out.println(lista.get(i));
//        }

        for (int i = 0; i < montako; i++) {
            int luku = io.nextInt();
//            int luku = 4;
            if (luku == 1) {
                lista.addLast(io.nextInt());
            } else if (luku == 2) {
                lista.addFirst(io.nextInt());
            } else if (luku == 3) {
                Collections.sort(lista);
            } else if (luku == 4) {
                inversio = 0;
                LinkedList<Integer> lista2 = new LinkedList();
                for (Integer eka : lista) {
                    lista2.add(eka);
                }
                for (int j = 0; j < lista2.size(); j++) {
                    for (int k = j - 1; k >= 0; k--) {
                        inversiot = 0;
                        if (lista2.get(k) > lista2.get(k + 1)) {
                            int apu = lista2.get(k + 1);
                            lista2.set(k + 1, lista2.get(k));
                            lista2.set(k, apu);
                            inversio++;
                            inversiot++;
                        } else break;
                    }
                    if (inversiot == 0) break;
                }
                io.print(inversio + "\n");
            }
        }

        //	String a = io.next(); // Lukee seuraavan välein erotellun merkkijonon.
//	int b = io.nextInt(); // Lukee seuraavan välein erotellun int-kokonaisluvun.
//	long c = io.nextLong(); // Lukee seuraavan välein erotellun long-kokonaisluvun.
//	double d = io.nextDouble(); // Lukee seuraavan välein erotellun double-liukuluvun.
        io.close();
    }

}
//                for (Integer eka : lista) {
//                    lista2.add(eka);
//                }
//                Collections.sort(lista2);
//                int a = 0;
//                for (Integer luku1 : lista) {
//                    int monesko = 0;
//                    for (Integer luku2 : lista2) {
//                        if (luku1 > luku2) {
//                            if (monesko - a > 0) {
//                                inversio += monesko - a;
//                            }
//                        }
//                        monesko++;
//                    }
//                    a++;
//                }

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: TIME LIMIT EXCEEDED

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: WRONG ANSWER