Integer $n>2$ is given. Find the biggest integer $d$, for which holds, that from any set $S$ consisting of $n$ integers, we can find three different (but not necesarilly disjoint) nonempty subsets, such that sum of elements of each of them is divisible by $d$.
1. **Model and Initial Observation**:
   Consider the set \( S = \{n+1, 2n+1, \ldots, n^2+1\} \). For this set, the only non-empty subset whose sum of elements is divisible by \( n \) is \( S \) itself. This implies that \( d < n \).

2. **Claim**:
   We claim that \( d = n-1 \). To support this claim, we will use two well-known results (lemmas).

3. **Lemma 1**:
   Given a set of (at least) \( N \) distinct integers, there exists a non-empty subset having its sum of elements divisible by \( N \). This is an old result by Erdős.

4. **Lemma 2**:
   The only sets of \( N-1 \) distinct integers, with no non-empty subset having its sum of elements divisible by \( N \), are those where all integers are congruent to the same residue modulo \( N \), and this residue is coprime with \( N \).

5. **Application of Lemma 1**:
   By Lemma 1, there exists a subset \( \emptyset \neq A \subseteq S \) having its sum of elements divisible by \( n-1 \). Take an arbitrary \( a \in A \).

6. **Finding Second Subset**:
   Again by Lemma 1, there exists a subset \( \emptyset \neq B \subseteq S \setminus \{a\} \) having its sum of elements divisible by \( n-1 \), and clearly \( B \neq A \). Take an arbitrary \( b \in B \), thus \( b \neq a \).

7. **Finding Third Subset**:
   If there exists a subset \( \emptyset \neq C \subseteq S \setminus \{a, b\} \) having its sum of elements divisible by \( n-1 \), we are done. Otherwise, by Lemma 2, there exists some \( r \) coprime with \( n-1 \) such that \( x \equiv r \pmod{n-1} \) for all \( x \in S \setminus \{a, b\} \).

8. **Special Cases**:
   If \( a \equiv 0 \pmod{n-1} \) or \( b \equiv 0 \pmod{n-1} \), we can easily fulfill the requirements. So, assume otherwise. This remark also solves the case \( n = 3 \), so we may assume \( n > 3 \).

9. **Interchangeability of Elements**:
   The subset \( B \) is therefore made of \( b \) and some number of elements from \( S \setminus \{a, b\} \). As these are interchangeable, if not all of them are used, then we can easily find another subset \( B' \) (different from \( B \) and \( A \)) having its sum of elements divisible by \( n-1 \).

10. **Final Case**:
    We are left with the case \( B = S \setminus \{a\} \), which forces \( b \equiv r \pmod{n-1} \). The subset \( A \) is therefore made of \( a \) and some number of the other \( n-1 \) elements, congruent with \( r \) modulo \( n-1 \). As these are interchangeable, and not all of them could have been used, then we can easily find other subsets \( A' \) and \( A'' \) (different from \( A \)) having their sum of elements divisible by \( n-1 \).

Thus, we have shown that for any set \( S \) of \( n \) integers, we can always find three different non-empty subsets such that the sum of elements of each subset is divisible by \( n-1 \).

\(\blacksquare\)

The final answer is \( \boxed{ n-1 } \).