Please help me answer this simple coding question for an online judge platform. You can write the code in either Python3 or Java8 ; whichever one is easier and faster. Please also provide screenshots of your output after entering the inputs; it should match the sample inputs and outputs in the question. Thank You!

The popular board game "Settlers of Catan" starts by creating a random board. This board consists of hexagonal resource tiles containing five different resources: clay, lumber, wool, grain, and ore. For simplicity, we will denote these by the numbers 1 to 5. Random boards, however, often have multiple equal resource tiles next to each other. This annoys some players. Therefore, we have invented a new way of creating the playing board. Starting in the middle and spiraling outwards, each time we add a new tile to the board we choose the resource of the tile according to the following rules: the new tile must be different from its neighboring tiles on the board so far; in case multiple tiles are possible, we choose a resource that occurs the least number of times on the board so far; in case multiple tiles are still possible, the new resource must have the lowest number possible. The figure underneath shows how to spiral outwards and which resource tiles are chosen first. We are curious what the number of the resource is on the nth tile that is added to the board (starting withn 1). The popular board game "Settlers of Catan" starts by creating a random board. This board consists of hexagonal resource tiles containing five different resources: clay, lumber, wool, grain, and ore. For simplicity, we will denote these by the numbers 1 to 5. Random boards, however, often have multiple equal resource tiles next to each other. This annoys some players. Therefore, we have invented a new way of creating the playing board. Starting in the middle and spiraling outwards, each time we add a new tile to the board we choose the resource of the tile according to the following rules: the new tile must be different from its neighboring tiles on the board so far; in case multiple tiles are possible, we choose a resource that occurs the least number of times on the board so far; in case multiple tiles are still possible, the new resource must have the lowest number possible. The figure underneath shows how to spiral outwards and which resource tiles are chosen first. We are curious what the number of the resource is on the nth tile that is added to the board (starting withn 1)