public static int pageCount(int n, int p) {
        // Write your code here
        
        int currentLeaf = 0;
        int countLeaf = 0;
        int minimum = 0;
        
        for(int page = currentLeaf; page <= n; page++){
            if(currentLeaf == p || currentLeaf + 1 == p) break;
            currentLeaf+=2;
            countLeaf++;
        }
        
        minimum = countLeaf;
        
        currentLeaf = n % 2 == 0 ? n+1 : n;
        countLeaf = 0;
        for(int page = currentLeaf; page > 0; page--){
            if(currentLeaf == p || currentLeaf - 1 == p) break;
            currentLeaf-=2;
            countLeaf++;
        }
        
        return minimum > countLeaf ? countLeaf : minimum;
    }