Fill the Rowboats!

Captain Jack decides to take over a rival's ship. He needs to send his henchmen over on rowboats that can hold 6 pirates each. Help him count out the pirates in groups of 6. The last rowboat may carry fewer than 6 pirates. To make counting easier, each pirate has been assigned a number from 1 to $N$.

The input is $N$, the number of pirates that must be sent over on rowboats.

Print the number of each pirate separated by single spaces, printing the word Go! after every 6th pirate and after the last pirate.

If N is a multiple of 6, the last pirate is also the 6th pirate of its group, so Go! is printed only once at that position.