For integer $a$, $a \neq 0$, $v_2(a)$ is greatest nonnegative integer $k$ such that $2^k | a$. For given $n \in \mathbb{N}$ determine highest possible cardinality of subset $A$ of set $ \{1,2,3,...,2^n \} $ with following property:
For all $x, y \in A$, $x \neq y$, number $v_2(x-y)$ is even.
1. **Define the problem and notation:**
   - Let \( T_n \) be the set \( \{1, 2, \ldots, 2^n\} \).
   - Let \( A_n \) be an acceptable subset of \( T_n \) such that for all \( x, y \in A_n \) with \( x \neq y \), the number \( v_2(x - y) \) is even.
   - We aim to determine the highest possible cardinality of \( A_n \), denoted as \( |A_n|_{\max} \).

2. **Base cases:**
   - For \( n = 1 \), \( T_1 = \{1, 2\} \). The acceptable subsets are \( \{1\} \), \( \{2\} \), and \( \{1, 2\} \). Thus, \( |A_1|_{\max} = 2 \).
   - For \( n = 2 \), \( T_2 = \{1, 2, 3, 4\} \). The acceptable subsets are \( \{1, 3\} \), \( \{2, 4\} \), and any single element subset. Thus, \( |A_2|_{\max} = 2 \).

3. **Inductive hypothesis:**
   - Assume \( |A_{2k}|_{\max} = 2^k \) for some \( k \).
   - We need to prove \( |A_{2k+1}|_{\max} = 2^{k+1} \) and \( |A_{2k+2}|_{\max} = 2^{k+1} \).

4. **Prove for \( |A_{2k+1}|_{\max} \):**
   - Consider the set \( T_{2k+1} = \{1, 2, \ldots, 2^{2k+1}\} \).
   - By the inductive hypothesis, we can choose at most \( 2^k \) elements from \( T_{2k} \subset T_{2k+1} \) such that the conditions are satisfied.
   - Let \( s_1, s_2, \ldots, s_{2^k} \in T_{2k} \) be such elements.
   - Consider the numbers \( 2^{2k} + s_1, 2^{2k} + s_2, \ldots, 2^{2k} + s_{2^k} \) which belong to \( T_{2k+1} - T_{2k} \).
   - The set \( B = \{s_1, s_2, \ldots, s_{2^k}, 2^{2k} + s_1, 2^{2k} + s_2, \ldots, 2^{2k} + s_{2^k}\} \) is acceptable.
   - The difference between any two elements in \( B \) is either of the form \( s_i - s_j \) or \( 2^{2k} + (s_i - s_j) \), both of which have even \( v_2 \).
   - Thus, \( |A_{2k+1}|_{\max} \geq |B| = 2^{k+1} \).

5. **Contradiction for larger sets:**
   - If there were an acceptable set with more than \( 2^{k+1} \) elements, one of the sets \( T_{2k} \) or \( T_{2k+1} - T_{2k} \) would contain at least \( 2^k + 1 \) elements, contradicting the inductive hypothesis.
   - Therefore, \( |A_{2k+1}|_{\max} = 2^{k+1} \).

6. **Prove for \( |A_{2k+2}|_{\max} \):**
   - Let \( C \) be an acceptable subset of \( T_{2k+2} \).
   - If \( C \) contains elements only from \( T_{2k+1} \) or \( T_{2k+2} - T_{2k+1} \), it can't have more than \( 2^{k+1} \) elements.
   - Suppose \( C \) contains elements from both \( T_{2k+1} \) and \( T_{2k+2} - T_{2k+1} \).
   - Let \( x, y \in C \) with \( y = 2^{2k+1} + z \) for some \( z \in T_{2k+1} \) and \( z \neq x \).
   - Then \( y - x = 2^{2k+1} + (z - x) \). Since \( z - x < 2^{2k+2} \), \( v_2(y - x) = v_2(z - x) \), which must be even.
   - Let \( D \subset C \) be the set of elements in \( C \) that belong to \( T_{2k+2} - T_{2k+1} \).
   - Subtract \( 2^{2k+1} \) from each element of \( D \) to form a new set \( E \).
   - The set \( F = E \cup (C - D) \) is acceptable and all its elements belong to \( T_{2k+1} \).
   - Since \( |F| = |C| \) and \( |F| \leq 2^{k+1} \), \( |C| \leq 2^{k+1} \).
   - This value can be achieved by selecting the set \( B \) as described earlier.

Thus, the highest possible cardinality of subset \( A \) of set \( \{1, 2, 3, \ldots, 2^n\} \) with the given property is \( 2^{\lfloor \frac{n+1}{2} \rfloor} \).

The final answer is \( \boxed{ 2^{\lfloor \frac{n+1}{2} \rfloor} } \).