class Solution {
    public int findNumbers(int[] nums) {
        int output = 0;
        int counter = 0;
        int division = 0;      
        for(int i = 0 ; i< nums.length ; i++){
            counter = 0; // reset counter 
            division = nums[i]; //taking the first element
            //repeat until number/10 is not equal to number. 
            do{
                 division = division / 10;
                  counter++;      
        }while( division / 10 != division);   
            
            //check if counter is even
                 if(counter % 2 == 0)
                      output++;    
        }
        return output;
    }
}