Provinces and Gold

아직 제출이 없습니다시간 제한1초메모리 제한1024 MB

문제

Jake is learning how to play the card game Dominion. In Dominion, you can buy a variety of treasure, action, and victory point cards - at the end of the game, the player with the most victory points wins!

Each turn, each player draws 5 cards and can use their action and treasure cards to obtain buying power in order to buy more cards. Since Jake is just starting out, he's decided to buy only treasure and victory point cards.

This means the cards he can buy are:

  • Province (costs 88, worth 66 victory points)
  • Duchy (costs 55, worth 33 victory points)
  • Estate (costs 22, worth 11 victory point)

And, there are 33 kinds of treasure cards:

  • Gold (costs 66, worth 33 buying power)
  • Silver (costs 33, worth 22 buying power)
  • Copper (costs 00, worth 11 buying power)

At the start of Jake's turn, he draws 55 of these cards. Given the number of Golds, Silvers, and Coppers in Jake's hand, calculate the best victory card and best treasure card he could buy that turn. Note that Jake can buy only one card.

입력

The input consists of a single test case on a single line, which contains three non-negative integers GG, SS, CC (G+S+C5G + S + C \le 5) indicating the number of Golds, Silvers, and Coppers Jake draws in his hand.

출력

Output the best victory card and the best treasure card Jake can buy this turn, separated with " or ", in this order. If Jake cannot afford any victory cards, output only the best treasure card he can buy.

힌트

In Sample Input 1, Jake has 11 Silver in his hand, which means he has 22 buying power. This would allow him to either buy an Estate or a Copper.