class Solution {
    public int findNumbers(int[] nums) {
        int ecount = 0;
        int num = 0;
        int count = 0;
        for (int i = 0; i < nums.length; i++) {
            num = nums[i];
            while (num > 0){
                num = num / 10;
                count++;
            }
            boolean value = count%2==0;
            if (value ){
                ecount++;
            }
            count = 0;
        }
        return ecount;
    }
    }