Via modular arithmetic this is very easy, and something you can check (if you're familiar with this). Otherwise, one can show the following result via the division algorithm (i.e. just straight division with quotient and remainder):
If $a$ and $b$ have the same remainder when divided by $n$, then $a-b$ is divisible by $n$.
The proof is as follows. Let $r$ be the common remainder of $a$ and $b$ when divided by $n$. The division algorithm gives integers $q,p$ such that $a=qn+r$ and $b=pn+r$. Thus, we get $$a-b=(qn+r)-(pn+r)=(qn-pn)+(r-r)=(q-p)n$$
so $n$ divides $a-b$.
Note that the above result is more general, and can be applied to your situation by having $a=S_j$ and $b=S_i$. It doesn't really matter that the $S_i$ and $S_j$ are sums of integers when applying the statement I just proved; as far as we care they are just some integers $a$ and $b$.