You are given an array of integers numbers. Your task is to count the number of distinct pairs (i, j) such that 0 < i < j < n, numbers[i] and numbers[j] have the same number of digits. How many such pairs exist?
a) 0
b) 1
c) 2
d) 3