Let $A$ be a countable set, some of its countable subsets are selected such that; the intersection of any two selected subsets has at most one element. Find the smallest $k$ for which one can ensure that we can color elements of $A$ with $k$ colors such that each selected subsets exactly contain one element of one of the colors and an infinite number of elements of each of the other colors.