Good Bye 2015
A
New Year and Days
Codeforces
900
原题
←B →
翻译中…

Today is Wednesday, the third day of the week. What's more interesting is that tomorrow is the last day of the year 2015.

翻译中…

Limak is a little polar bear. He enjoyed this year a lot. Now, he is so eager to the coming year 2016.

翻译中…

Limak wants to prove how responsible a bear he is. He is going to regularly save candies for the entire year 2016! He considers various saving plans. He can save one candy either on some fixed day of the week or on some fixed day of the month.

翻译中…

Limak chose one particular plan. He isn't sure how many candies he will save in the 2016 with his plan. Please, calculate it and tell him.

翻译中…

Input

翻译中…

The only line of the input is in one of the following two formats:

翻译中…
  • "x of week" where $*x*$ ($1 ≤ *x* ≤ 7$) denotes the day of the week. The 1-st day is Monday and the 7-th one is Sunday.
  • "x of month" where $*x*$ ($1 ≤ *x* ≤ 31$) denotes the day of the month.
翻译中…

Output

翻译中…

Print one integer — the number of candies Limak will save in the year 2016.

翻译中…

Note

翻译中…

Polar bears use the Gregorian calendar. It is the most common calendar and you likely use it too. You can read about it on Wikipedia if you want to – https://en.wikipedia.org/wiki/Gregorian_calendar. The week starts with Monday.

翻译中…

In the first sample Limak wants to save one candy on each Thursday (the 4-th day of the week). There are $52$ Thursdays in the 2016. Thus, he will save $52$ candies in total.

翻译中…

In the second sample Limak wants to save one candy on the 30-th day of each month. There is the 30-th day in exactly $11$ months in the 2016 — all months but February. It means that Limak will save $11$ candies in total.

翻译中…

样例

Input #1
4 of week
Output #1
52
InputCopy OutputCopy
Input #2
30 of month
Output #2
11
InputCopy OutputCopy
题目信息
题号
611A
所属比赛
时间限制
2 s
内存限制
256 MB
标签
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。