Players A and B play a game. They are given a box with $n=>1$ candies. A starts first. On a move, if in the box there are $k$ candies, the player chooses positive integer $l$ so that $l<=k$ and $(l, k) =1$, and eats $l$ candies from the box. The player who eats the last candy wins. Who has winning strategy, in terms of $n$.
1. **Initial Setup and Definitions**:
   - Let \( n \) be the number of candies in the box.
   - Player A starts first.
   - On each move, a player chooses a positive integer \( l \) such that \( l \leq k \) and \(\gcd(l, k) = 1\), where \( k \) is the current number of candies in the box.
   - The player who eats the last candy wins.

2. **Case Analysis for Odd \( n \)**:
   - If \( n \) is odd, consider the first move by Player A.
   - Player A can choose \( l = n - 2 \) (since \( n - 2 \) is an odd number and \(\gcd(n-2, n) = 1\) for odd \( n \)).
   - After this move, \( k = 2 \) candies remain.
   - Player B must then choose \( l = 1 \) (since \(\gcd(1, 2) = 1\)), leaving 1 candy.
   - Player A then eats the last candy and wins.
   - Therefore, for odd \( n \), Player A has a winning strategy.

3. **Case Analysis for Even \( n \)**:
   - If \( n \) is even, Player A must choose an odd number \( l \) such that \(\gcd(l, n) = 1\).
   - By choosing an odd \( l \), the remaining number of candies \( k = n - l \) will be odd (since even minus odd is odd).
   - Now, Player B faces an odd number of candies, which we have already established is a winning position for the first player.
   - Therefore, Player A can force the game into a situation where Player B faces an odd number of candies, ensuring Player A's victory.

4. **Conclusion**:
   - Player A wins if \( n \) is odd.
   - Player A can also force a win if \( n \) is even by making the number of candies odd for Player B's turn.

Thus, Player A has a winning strategy if and only if \( n \) is odd.

The final answer is \( \boxed{ n \equiv 1 \pmod{2} } \)