$n$ is a fixed natural number. Find the least $k$ such that for every set $A$ of $k$ natural numbers, there exists a subset of $A$ with an even number of elements which the sum of it's members is divisible by $n$.
1. **Understanding the Problem:**
   We need to find the smallest integer \( k \) such that for any set \( A \) of \( k \) natural numbers, there exists a subset of \( A \) with an even number of elements whose sum is divisible by \( n \).

2. **Case Analysis:**
   We will consider two cases based on whether \( n \) is odd or even.

3. **Case 1: \( n \) is odd:**
   - **Counterexample for \( k = 2n - 1 \):**
     Consider a set \( A \) of \( 2n - 1 \) elements, all congruent to \( 1 \mod n \). Any subset of \( A \) will have a sum congruent to the number of elements in the subset modulo \( n \). Since \( n \) is odd, any subset with an even number of elements will have a sum congruent to an even number modulo \( n \), which cannot be zero modulo \( n \). Hence, \( k = 2n - 1 \) is not sufficient.
   - **Proof for \( k = 2n \):**
     Consider any set \( A \) of \( 2n \) elements. We can partition \( A \) into two disjoint subsets \( A_1 \) and \( A_2 \) each containing \( n \) elements. By the Pigeonhole Principle, there exists a subset of \( A_1 \) whose sum is divisible by \( n \). If this subset has an even number of elements, we are done. If it has an odd number of elements, consider the subset of \( A_2 \) whose sum is divisible by \( n \). If this subset has an even number of elements, we are done. If both subsets have an odd number of elements, their union will have an even number of elements, and the sum of their elements will be divisible by \( n \). Thus, \( k = 2n \) is sufficient.

4. **Case 2: \( n \) is even:**
   - **Counterexample for \( k = n \):**
     Consider a set \( A \) of \( n \) elements, where \( n - 1 \) elements are congruent to \( 1 \mod n \) and one element is congruent to \( 0 \mod n \). Any subset of \( A \) with an even number of elements will have a sum congruent to an even number modulo \( n \), which cannot be zero modulo \( n \). Hence, \( k = n \) is not sufficient.
   - **Proof for \( k = n + 1 \):**
     Consider any set \( A \) of \( n + 1 \) elements. By the Pigeonhole Principle, there exists a subset of \( A \) whose sum is divisible by \( n \). If this subset has an even number of elements, we are done. If it has an odd number of elements, consider the remaining elements. Since \( n \) is even, the remaining elements form a set of even cardinality, and we can find a subset of these elements whose sum is divisible by \( n \). Thus, \( k = n + 1 \) is sufficient.

5. **Conclusion:**
   - For odd \( n \), the least \( k \) is \( 2n \).
   - For even \( n \), the least \( k \) is \( n + 1 \).

The final answer is \( \boxed{ k = 2n } \) for odd \( n \) and \( k = n + 1 \) for even \( n \).