Given two positive integers $a \ne b$, let $f(a, b)$ be the smallest integer that divides exactly one of $a, b$, but not both. Determine the number of pairs of positive integers $(x, y)$, where $x \ne y$, $1\le x, y, \le 100$ and $\gcd(f(x, y), \gcd(x, y)) = 2$.

Let's think step by step and output the final answer within \boxed{}.
user