Persian Party

#include <iostream>

using namespace std;

int main(){
    int n;
        cin>> n;

    int ad[n][2], i=0, j;

        while(i<n){
            j=0;
            while(j<2){
                cin>> ad[i][j];
                ++j;
            }
            ++i;
        }

    int i1=0, j1=0, i2=1, j2=1;
    int v=0;

    while(true){

        if(ad[i1][j1]<ad[i2][j2]){
            j2=0;

            if(ad[i1][j1]>ad[i2][j2]){
                v++;

                if(i2==n-1){
                    if(i1==i2){
                        break;
                    }
                    else{
                        i1++; i2=0; j2=1;
                    }
                }
                else{
                    i2++; j2=1;
                }
            }
            else{

                if(i2==n-1){
                    if(i1==i2)
                        break;
                    else{
                        i1++; i2=0; j2=1;
                    }
                }
                else{
                    i2++; j2=1;
                }
            }
        }
        else{

            if(i2==n-1){
                if(i1==i2)
                    break;
                else{
                    i1++; i2=0; j2=1;
                }
            }
            else
                i2++;
        }
    }
    cout<<(v+n)*2;
}