Largest Component Size by Common Factor

Given a non-empty array of unique positive integers, find the size of the largest subset such that every pair of elements in the subset (i, j) satisfies:

i % j = 0 or j % i = 0 (where % denotes the modulo operation).