class BTreeNode {
    public int value;
    
    public BTreeNode leftNode  = null;
    public BTreeNode rightNode = null;
    
    public BTreeNode(int value) {
        this.value = value;
    }
    
    public int push(int value) {
        if (value < this.value)
            if (leftNode == null) {
                leftNode = new BTreeNode(value);
                return  0 ;
            }
            else return leftNode.push(value);
        
        if (value > this.value)
            if (rightNode == null) {
                rightNode = new BTreeNode(value);
                return  0 ;
            }
            else return rightNode.push(value);

        return  1 ;
    }
}

public class Main {

    public static void main(String[] args) {
        int numbers[] = { 1 , 6 , 4 , 3 , 8 , 6 , 7 , 5 , 3 , 4 , 2 , 5 , 1 , 0 , 7 , 8 , 5 , 9 , 7 , 8 , 3 };
        int totalIters =  0 ;
        
        BTreeNode root = new BTreeNode(numbers[ 0 ]);
        
        for(int i =  1 ; i < numbers.length; i++)
            totalIters += root.push(numbers[i]);
        
        System.out.println(totalIters);
    }

}