The fundamental symmetric functions are EX _k ⁿ (equal to 1 if the sum of n input bits is exactly k), TH _k ⁿ (the sum is at least k), and MOD _m,r ⁿ (the sum is congruent to r modulo m). It is well known that all these functions and in fact any symmetric Boolean function have linear circuit size. Simple counting shows that the circuit complexity of computing n symmetric functions is Ω(n ^{2 - o(1)}) for almost all tuples of n symmetric functions. It is well-known that all EX and TH functions (i.e., for all 0 ≤ k ≤ n) of n input bits can be computed by linear size circuits. In this short note, we investigate the circuit complexity of computing all MOD functions (for all 1 ≤ m ≤ n). We prove an O(n) upper bound for computing the set of functions {MOD _1,r ⁿ, MOD _2,r ⁿ,..., MOD _n,r ⁿ} and an O(nloglogn) upper bound for {MOD _1,r1 ⁿ, MOD _2,r2 ⁿ,..., MOD _n,rn ⁿ}, where r ₁, r ₂,..., r _n are arbitrary integers.