Problem D
Huge Deck
Alice and Bob are designing a brand new card game that uses multiple standard 52-card decks. During playtesting, they realized that different game modes require different numbers of cards, and therefore different numbers of decks. To avoid running out of cards mid-game, they want to buy exactly the number of decks needed.
For each game mode, Alice and Bob have calculated the total number of cards required. However, since they can only buy full decks, they must determine how many complete 52-card decks are needed to supply at least that many cards.
Input
The input consists of a single integer $N (1 \le N \le 10^6)$ the maximum number of cards that Alice and Bob need for their new card game.
Output
A single integer denoting how many standard 52-card decks Alice and Bob need to buy to have at least $N$ cards.
| Sample Input 1 | Sample Output 1 |
|---|---|
52 |
1 |
| Sample Input 2 | Sample Output 2 |
|---|---|
520 |
10 |
| Sample Input 3 | Sample Output 3 |
|---|---|
3484 |
67 |
