Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)
A
Checking the Calendar
Codeforces
1000
原题
←B →
翻译中…

You are given names of two days of the week.

翻译中…

Please, determine whether it is possible that during some non-leap year the first day of some month was equal to the first day of the week you are given, while the first day of the next month was equal to the second day of the week you are given. Both months should belong to one year.

翻译中…

In this problem, we consider the Gregorian calendar to be used. The number of months in this calendar is equal to 12. The number of days in months during any non-leap year is: $31$, $28$, $31$, $30$, $31$, $30$, $31$, $31$, $30$, $31$, $30$, $31$.

翻译中…

Names of the days of the week are given with lowercase English letters: "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday".

翻译中…

Input

翻译中…

The input consists of two lines, each of them containing the name of exactly one day of the week. It's guaranteed that each string in the input is from the set "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday".

翻译中…

Output

翻译中…

Print "YES" (without quotes) if such situation is possible during some non-leap year. Otherwise, print "NO" (without quotes).

翻译中…

Note

翻译中…

In the second sample, one can consider February 1 and March 1 of year 2015. Both these days were Sundays.

翻译中…

In the third sample, one can consider July 1 and August 1 of year 2017. First of these two days is Saturday, while the second one is Tuesday.

翻译中…

样例

Input #1
monday
tuesday
Output #1
NO
InputCopy OutputCopy
Input #2
sunday
sunday
Output #2
YES
InputCopy OutputCopy
Input #3
saturday
tuesday
Output #3
YES
InputCopy OutputCopy
题目信息
题号
724A
时间限制
1 s
内存限制
256 MB
标签
模拟

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