We are given an enumeration of A by a 1-1 correspondence
f : N → A. This enumeration has no repetitions.
Hint. Prove that you can use the enumeration f to obtain a different enumeration where each member of A is enumerated infinitely many times.
You will find the traversal with north-east arrows, profitable. Traversal of what? (This I leave to you :)