$N$ coins are placed on a table, $N - 1$ are genuine and have the same weight, and one is fake, with a different weight. Using a two pan balance, the goal is to determine with certainty the fake coin, and whether it is lighter or heavier than a genuine coin. Whenever one can deduce that one or more coins are genuine, they will be inmediately discarded and may no longer be used in subsequent weighings. Determine all $N$ for which the goal is achievable. (There are no limits regarding how many times one may use the balance).

Note: the only difference between genuine and fake coins is their weight; otherwise, they are identical.
To determine all \( N \) for which it is possible to identify the fake coin and whether it is lighter or heavier using a two-pan balance, we need to analyze the problem systematically.

1. **Base Cases:**
   - For \( N = 2 \): We have two coins. If we weigh them against each other, we can determine which one is fake, but we cannot determine if it is lighter or heavier because we have no reference genuine coin left.
   - For \( N = 3 \): We can weigh two coins against each other. If they balance, the third coin is fake, but we cannot determine if it is lighter or heavier. If they do not balance, we know one of the two coins on the balance is fake, but we cannot determine which one is fake and whether it is lighter or heavier.

2. **Induction Hypothesis for Odd \( N \):**
   - We will prove by induction that for \( N = 2n + 1 \) (odd \( N \)), it is impossible to determine the fake coin and whether it is lighter or heavier.
   - **Base Case:** For \( n = 1 \), \( N = 3 \), we have already shown it is impossible.
   - **Inductive Step:** Assume it is impossible for \( N = 2n + 1 \). We need to show it is impossible for \( N = 2(n + 1) + 1 = 2n + 3 \).
     - Suppose we have \( 2n + 3 \) coins. If we put \( n + 1 \) coins on each side of the balance, there are three possibilities:
       - If the balance is equal, the remaining coin is fake, but we cannot determine if it is lighter or heavier.
       - If the balance is not equal, we cannot determine which side contains the fake coin and whether it is lighter or heavier because we have no reference genuine coin left after discarding the balanced coins.
     - Therefore, it is impossible to determine the fake coin and whether it is lighter or heavier for \( N = 2n + 3 \).

3. **Induction Hypothesis for Even \( N \):**
   - We will prove by induction that for \( N = 2n + 2 \) (even \( N \)), it is possible to determine the fake coin and whether it is lighter or heavier.
   - **Base Case:** For \( n = 1 \), \( N = 4 \):
     - Weigh two coins against the other two coins. If they balance, all four coins are genuine, which contradicts the problem statement. If they do not balance, we can determine the fake coin and whether it is lighter or heavier by comparing two coins from the heavier side with two coins from the lighter side.
   - **Inductive Step:** Assume it is possible for \( N = 2n + 2 \). We need to show it is possible for \( N = 2(n + 1) + 2 = 2n + 4 \).
     - Suppose we have \( 2n + 4 \) coins. Weigh \( n + 2 \) coins against \( n + 2 \) coins. If they balance, the remaining two coins contain the fake coin, and we can determine which one is fake and whether it is lighter or heavier by comparing them.
     - If they do not balance, we can discard the balanced coins and use the remaining \( 2n + 2 \) coins to find the fake coin by the induction hypothesis.

4. **Conclusion:**
   - For \( N = 2n + 2 \) (even \( N \)), it is possible to determine the fake coin and whether it is lighter or heavier.
   - For \( N = 2n + 1 \) (odd \( N \)), it is impossible to determine the fake coin and whether it is lighter or heavier.

The final answer is \( \boxed{ N = 2n + 2 } \), \( n \in \mathbb{N} \).