Nim game

You are encouraged to solve this task according to the task description, using any language you may know.
Nim is a simple game where the second player ─── if they know the trick ─── will always win.



The game has only 3 rules:

   start with   12   tokens
   each player takes   1,  2,  or  3   tokens in turn
  the player who takes the last token wins.


To win every time,   the second player simply takes 4 minus the number the first player took.   So if the first player takes 1,   the second takes 3 ─── if the first player takes 2,   the second should take 2 ─── and if the first player takes 3,   the second player will take 1.



Task

Design a simple Nim game where the human player goes first, and the computer always wins. The game should enforce the rules.




heap:=12;
while heap>0 do
    !!('There are ',heap,' tokens left. How many do you want to take?');
    ?take;
    while take<1 or take>3 or take>heap do
        !!('You cannot take that number. Choose again.');
        ?take;
    od;
    !!('On my turn I will take ',4-take,' tokens.');
    heap:-(4);
od;
 
!!('I got the last token. Better luck next time!');