Problem:
 Score : 100 points    Problem Statement Given is a string S representing the day of the week today.  S is SUN , MON , TUE , WED , THU , FRI , or SAT , for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.  After how many days is the next Sunday (tomorrow or later)?      Constraints  S is SUN , MON , TUE , WED , THU , FRI , or SAT .         Input Input is given from Standard Input in the following format:  S       Output Print the number of days before the next Sunday.        Sample Input 1 SAT      Sample Output 1 1  It is Saturday today, and tomorrow will be Sunday.       Sample Input 2 SUN      Sample Output 2 7  It is Sunday today, and seven days later, it will be Sunday again.

Solution (Python):




S = input()

if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
else:
    print(1)

Solution (Python):
days = ['SUN','MON','TUE','WED','THU','FRI','SAT']
Day_of_the_week = input()

for index, day in enumerate(days):
    if Day_of_the_week == day:
        print(7 - index)

Solution (Python):



s = input()


if s == "SUN":
    print(7)
elif s == "MON":
    print(6)
elif s == "TUE":
    print(5)
elif s == "WED":
    print(4)
elif s == "THU":
    print(3)
elif s == "FRI":
    print(2)
else:
    print(1)

Solution (Python):
s = input()

if s == 'SUN':
    print(int(7))
elif s == 'MON':
    print(int(6))
elif s == 'TUE':
    print(int(5))
elif s == 'WED':
    print(int(4))
elif s == 'THU':
    print(int(3))
elif s == 'FRI':
    print(int(2))
elif s == 'SAT':
    print(int(1))
else:
    print('曜日が入力されていません')

Solution (Python):
S = input()

if S == 'SUN':
    answer = 7

elif S == 'MON':
    answer = 6

elif S == 'TUE':
    answer = 5

elif S == 'WED':
    answer = 4

elif S == 'THU':
    answer = 3

elif S == 'FRI':
    answer = 2

elif S == 'SAT':
    answer = 1

print(answer)

Solution (Python):
S = input()

if S == 'SUN':
    print(7)
if S == 'MON':
    print(6)
if S == 'TUE':
    print(5)
if S == 'WED':
    print(4)
if S == 'THU':
    print(3)
if S == 'FRI':
    print(2)
if S == 'SAT':
    print(1)

Solution (Python):

S = input()

if S == 'SUN':
    answer = 7
elif S == 'MON':
    answer = 6
elif S == 'TUE':
    answer = 5
elif S == 'WED':
    answer = 4
elif S == 'THU':
    answer = 3
elif S == 'FRI':
    answer = 2
elif S == 'SAT':
    answer = 1
else:
    answer = '入力間違い【SUN】【MON】【TUE】【WED】【THU】【FRI】【SAT】を入力'

print(answer)

Solution (Python):
S  =  input()

if S  ==  'SUN' :
    print(7)
elif  S  ==  'MON':
    print(6)
elif  S  ==  'TUE':
    print(5)
elif  S  ==  'WED':
    print(4)
elif  S  ==  'THU':
    print(3)
elif  S  ==  'FRI':
    print(2)
elif  S  ==  'SAT':
    print(1)

Solution (Python):




s = input()
if s =='SUN':
    print('7')
elif s == 'MON':
    print('6')
elif s == ('TUE'):
    print('5')
elif s == 'WED':
    print('4')
elif s == 'THU':
    print('3')
elif s == 'FRI':
    print('2')
elif s == 'SAT':
    print('1')

Solution (Python):
s = input()
if s == "SUN":
    print(7)
elif s == "MON":
    print(6)
elif s == "TUE":
    print(5)
elif s == "WED":
    print(4)
elif s == "THU":
    print(3)
elif s == "FRI":
    print(2)
elif s == "SAT":
    print(1)

Solution (Python):

S = input()

if S == 'SUN':
    answer = (7)
elif S == 'MON':
    answer = (6)
elif S == 'TUE':
    answer = (5)
elif S == 'WED':
    answer = (4)
elif S == 'THU':
    answer = (3)
elif S == 'FRI':
    answer = (2)
elif S == 'SAT':
    answer = (1)

print(answer)

Solution (Python):
S = input()
wait_day = 0

if S == "SUN":
  wait_day = 7
elif S == "MON":
  wait_day = 6
elif S == "TUE":
  wait_day = 5
elif S == "WED":
  wait_day = 4
elif S == "THU":
  wait_day = 3
elif S == "FRI":
  wait_day = 2
elif S == "SAT":
  wait_day = 1

print(wait_day)

Solution (Python):
S = input()

if S == 'SUN':
    print(7)

elif S == 'MON':
    print(6)

elif S =='TUE':
    print(5)

elif S =='WED':
    print(4)

elif S =='THU':
    print(3)

elif S =='FRI':
    print(2)

elif S =='SAT':
    print(1)

Solution (Python):






input_weekday = input()


result = 0
if input_weekday == 'SUN':
    result = 7
elif input_weekday == 'MON':
    result = 6
elif input_weekday == 'TUE':
    result = 5
elif input_weekday == 'WED':
    result = 4
elif input_weekday == 'THU':
    result = 3
elif input_weekday == 'FRI':
    result = 2
elif input_weekday == 'SAT':
    result = 1

print(result)

Solution (Python):
S = input()

if S =="SAT":
    print(1)

elif S =="FRI":
    print(2)

elif S =="THU":
    print(3)

elif S =="WED":
    print(4)

elif S =="TUE":
    print(5)

elif S =="MON":
    print(6)

elif S =="SUN":
    print(7)

Solution (Python):
S = input()

if S == ('SUN'):
    print(7)
elif S == ('MON'):
    print(6)
elif S == ('TUE'):
    print(5)
elif S == ('WED'):
    print(4)
elif S == ('THU'):
    print(3)
elif S == ('FRI'):
    print(2)
elif S == ('SAT'):
    print(1)
else:
    print('入力に誤りがあります。SUN,MON,TUE,WED,THU,FRI,SATのいずれかを入力してください。')

Solution (Python):
S=input()
if S=="SUN":
  print(7)
elif S=="MON":
  print(6)
elif S=="TUE":
  print(5)
elif S=="WED":
  print(4)
elif S=="THU":
  print(3)
elif S=="FRI":
  print(2)
elif S=="SAT":
  print(1)

Solution (Python):
S = input()
List = {'SUN':'7', 'MON':'6', 'TUE':'5', 'WED':'4', 'THU':'3', 'FRI':'2', 'SAT':'1'}
print(List[S])

Solution (Python):
print({'SUN':'7', 'MON':'6', 'TUE':'5', 'WED':'4', 'THU':'3', 'FRI':'2', 'SAT':'1'}[input()])

Solution (Python):










S = input()
if S == 'SAT':
    result = 1
elif S == 'FRI':
    result = 2
elif S == 'THU':
    result = 3
elif S == 'WED':
    result = 4
elif S == 'TUE':
    result = 5
elif S == 'MON':
    result = 6
elif S == 'SUN':
    result = 7

print(result)

Solution (Python):
S = input()

if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
elif S == 'SAT':
    print(1)

Solution (Python):
S = input()

if S == 'SUN':
    print('7')

elif S == 'MON':
    print('6')

elif S == 'TUE':
    print('5')

elif S == 'WED':
    print('4')

elif S == 'THU':
    print('3')

elif S == 'FRI':
    print('2')

elif S == 'SAT':
    print('1')

Solution (Python):









week = input()
if week == 'SAT':
    result = 1
elif week == 'FRI':
    result = 2
elif week == 'THU':
    result = 3
elif week == 'WED':
    result = 4
elif week == 'TUE':
    result = 5
elif week == 'MON':
    result = 6
elif week == 'SUN':
    result = 7

print(result)

Solution (Python):
S = input()
if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
else:
    print(1)

Solution (Python):
print(7 - ['SUN','MON','TUE','WED','THU','FRI','SAT'].index(input()))

Solution (Python):
print(['SAT','FRI','THU','WED','TUE','MON','SUN'].index(input()) + 1)

Solution (Python):
S = input()

if S == 'SUN':
    print('7')

if S == 'MON':
    print('6')

if S == 'TUE':
    print('5')

if S == 'WED':
    print('4')

if S == 'THU':
    print('3')

if S == 'FRI':
    print('2')

if S == 'SAT':
    print('1')

Solution (Python):
S = input()
if S == 'SUN':
    print('7')
elif S == 'MON':
    print('6')
elif S == 'TUE':
    print('5')
elif S == 'WED':
    print('4')
elif S == 'THU':
    print('3')
elif S == 'FRI':
    print('2')
elif S == 'SAT':
    print('1')
else:
    print('入力エラー')

Solution (Python):
a=input()
if a=="SUN":
  print("7")
if a=="MON":
  print("6")
if a=="TUE":
  print("5")
if a=="WED":
  print("4")
if a=="THU":
  print("3")
if a=="FRI":
  print("2")
if a=="SAT":
  print("1")

Solution (Python):
input_date_list = ['SUN','MON','TUE','WED','THU','FRI','SAT' ]
S = input()
today_date_list = ['日','月','火','水','木','金','土']
s1 = input_date_list.index(S)
today_date = (today_date_list[s1])
s2 = 7 - s1
print(s2)

Solution (Python):
S = input()
if S == "SUN":
    print("7")
if S == "MON":
    print("6")
if S == "TUE":
    print("5")
if S == "WED":
    print("4")
if S == "THU":
    print("3")
if S == "FRI":
    print("2")
if S == "SAT":
    print("1")

Solution (Python):



S = input()

if S == 'SUN':
    answer = 7
elif S == 'MON':
    answer = 6
elif S == 'TUE':
    answer = 5
elif S == 'WED':
    answer = 4
elif S == 'THU':
    answer = 3
elif S == 'FRI':
    answer = 2
elif S == 'SAT':
    answer = 1
else:
    answer = '入力エラー'

print(answer)

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    S = _S()
    youbi = ["MON","TUE","WED","THU","FRI","SAT","SUN"][::-1]
    print(youbi.index(S) if S!="SUN" else 7)

main()

Solution (Python):

S = input()
 

if S == "SAT":
  print(1)
elif S == "FRI":
  print(2)
elif S == "THU":
  print(3)
elif S == "WED":
  print(4)
elif S == "TUE":
  print(5)
elif S == "MON":
  print(6)
elif S == "SUN":
  print(7)
else:
  print("入力内容が間違っています。")

Solution (Python):
input_date_list = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
S = input()
today_date_list = ['日', '月', '火', '水', '木', '金', '土']
s1 = input_date_list.index(S)
today_date = (today_date_list[s1])
s2 = 7 - s1
print(s2)

Solution (Python):
S = input()

if S == 'SUN':
    print('7')
elif S == 'MON':
    print('6')
elif S == 'TUE':
    print('5')
elif S == 'WED':
    print('4')
elif S == 'THU':
    print('3')
elif S == 'FRI':
    print('2')
else:
    print('1')

Solution (Python):




s = str(input())


if s == "SUN":
    print(7)
elif s == "MON":
    print(6)
elif s == "TUE":
    print(5)
elif s == "WED":
    print(4)
elif s == "THU":
    print(3)
elif s == "FRI":
    print(2)
elif s == "SAT":
    print(1)

Solution (Python):
S = input()
if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
elif S == 'SAT':
    print(1)

Solution (Python):
S = input()
if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
elif S == 'SAT':
    print(1)

Solution (Python):
weekday = ['SUN', 'SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON']
val = input()
if val == 'SUN':
    print("7")
else:
    print(weekday.index(val))

Solution (Python):
S = input()
if S == 'SUN':
    print(7)
if S == 'MON':
    print(6)
if S == 'TUE':
    print(5)
if S == 'WED':
    print(4)
if S == 'THU':
    print(3)
if S == 'FRI':
    print(2)
if S == 'SAT':
    print(1)

Solution (Python):

S = input()

if S == 'SUN':
    print('7')
elif S == 'MON':
    print('6')
elif S == 'TUE':
    print('5')
elif S == 'WED':
    print('4')
elif S == 'THU':
    print('3')
elif S == 'FRI':
    print('2')
elif S == 'SAT':
    print('1')
else:
    print('以下の表記で入力してください。（例：「月曜日」=> 「MON」')

Solution (Python):



SUN_N = 0
MON_N = 1
TUE_N = 2
WED_N = 3
THU_N = 4
FRI_N = 5
SAT_N = 6

S = input() 

if S == 'SUN':
    From_days = SUN_N
elif S == 'MON':
    From_days = MON_N
elif S == 'TUE':
    From_days = TUE_N
elif S == 'WED':
    From_days = WED_N
elif S == 'THU':
    From_days = THU_N
elif S == 'FRI':
    From_days = FRI_N
elif S == 'SAT':
    From_days = SAT_N
else:
    From_days = -99

To_days = 7 - From_days

print(To_days)

Solution (Python):
day=["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7-day.index(input()))

Solution (Python):
S = input()

if S == 'SUN':
    print('7')
if S == 'MON':
    print('6')
if S == 'TUE':
    print('5')
if S == 'WED':
    print('4')
if S == 'THU':
    print('3')
if S == 'FRI':
    print('2')
if S == 'SAT':
    print('1')

Solution (Python):
S=input()

if S=='SAT':
    print('1')
elif S=='FRI':
    print('2')
elif S=='THU':
    print('3')
elif S=='WED':
    print('4')
elif S=='TUE':
    print('5')
elif S=='MON':
    print('6')
else:
    print('7')

Solution (Python):
s = input()

if s == 'SUN':
    print(7)
elif s == 'MON':
    print(6)
elif s == 'TUE':
    print(5)
elif s == 'WED':
    print(4)
elif s == 'THU':
    print(3)
elif s == 'FRI':
    print(2)
elif s == 'SAT':
    print(1)

Solution (Python):
s = input()
if s == "SUN":
  print(7)
elif s == "MON":
  print(6)
elif s == "TUE":
  print(5)
elif s == "WED":
  print(4)
elif s == "THU":
  print(3)
elif s == "FRI":
  print(2)
elif s == "SAT":
  print(1)

Solution (Python):
S = input()

if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
else:
    print(1)

Solution (Python):
from sys  import stdin,stdout

import bisect

import math

from collections import deque,Counter

mod=10**9 +7 

def st():
    return list(stdin.readline().strip())

def inp():
    return int(stdin.readline())

def li():
    return list(map(int,stdin.readline().split()))

def mp():
    return map(int,stdin.readline().split())

def pr(n):
    stdout.write(str(n)+"\n")
    
def DFS(dictionary,vertex,visited):
    visited[vertex]=True
    stack=[vertex]
    print(vertex)
    while stack:
        a=stack.pop()
        for i in dictionary[a]:
            if not visited[i]:
                print(i)
                visited[i]=True
                stack.append(i)


def BFS(dictionary, vertex,visited):
    visited[vertex]=True
    q=deque()
    q.append(vertex)
    while q:
        a=q.popleft()
        for i in dictionary[a]:
            if not visited[i]:
                visited[i]=True
                q.append(i)
                print(i)

                


def soe(limit):
    l=[1]*(limit+1)
    l[0]=0
    l[1]=0
    prime=[]
    for i in range(2,limit+1):
        if l[i]:
            for j in range(i*i,limit+1,i):
                l[j]=0
    
    for i in range(2,limit+1):
        if l[i]:
            prime.append(i)
    return prime

def segsoe(low,high):
    limit=int(high**0.5)+1
    prime=soe(limit)
    n=high-low+1
    l=[0]*(n+1)
    for i in range(len(prime)):
        lowlimit=(low//prime[i])*prime[i]
        if lowlimit<low:
            lowlimit+=prime[i]
        if lowlimit==prime[i]:
            lowlimit+=prime[i]
        for j in range(lowlimit,high+1,prime[i]):
            l[j-low]=1
    for i in range(low,high+1):
        if not l[i-low]:
            if i!=1:
                print(i)
                
def gcd(a,b):
    while b:
        a=a%b
        b,a=a,b
    return a

def power(a,n):
    r=1
    while n:
        if n&1:
            r=(r*a)
        a*=a
        n=n>>1
    return r
  

def solve():
    d={'SUN':1,'MON':2,'TUE':3,'WED':4,'THU':5,'FRI':6,'SAT':7}
    s=input()
    pr(7-(d[s]-1))
    
    
for _ in range(1):
    solve()

Solution (Python):

S = input('')


if S == str('SUN'):
    print(7)
elif S == str('MON'):
    print(6)
elif S == str('TUE'):
    print(5)
elif S == str('WED'):
    print(4)
elif S == str('THU'):
    print(3)
elif S == str('FRI'):
    print(2)
else:
    print(1)

Solution (Python):
S = input()
if(S=='SUN'):
    print(7)
elif(S=='MON'):
    print(6)
elif(S=='TUE'):
    print(5)
elif (S=='WED'):
    print(4)
elif (S=='THU'):
    print(3)
elif (S=='FRI'):
    print(2)
else:
    print(1)

Solution (Python):
day = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
d = input()
print(7 - day.index(d))

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

S = input()

if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
elif S == 'SAT':
    print(1)

Solution (Python):
S = input()

if S == "SUN":
    print("7")
if S == "MON":
    print("6")
if S == "TUE":
    print("5")
if S == "WED":
    print("4")
if S == "THU":
    print("3")
if S == "FRI":
    print("2")
if S == "SAT":
    print("1")

Solution (Python):
S = input()
L = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]

ans = 7 - L.index(S)

print(ans)

Solution (Python):
S = input()
if S == 'SUN':
    print("7")
elif S == 'MON':
    print("6")
elif S == 'TUE':
    print("5")
elif S == 'WED':
    print("4")
elif S == 'THU':
    print("3")
elif S == 'FRI':
    print("2")
else:
    print("1")

Solution (Python):
S = input()
if S == 'SUN':
    print('7')
if S == 'MON':
    print('6')
if S == 'TUE':
    print('5')
if S == 'WED':
    print('4')
if S == 'THU':
    print('3')
if S == 'FRI':
    print('2')
if S == 'SAT':
    print('1')

Solution (Python):

weekday=input()

if weekday=='SUN':
    print(7)
elif weekday=='MON':
    print(6)
elif weekday=='TUE':
    print(5)
elif weekday=='WED':
    print(4)
elif weekday=='THU':
    print(3)
elif weekday=='FRI':
    print(2)
elif weekday=='SAT':
    print(1)

Solution (Python):

weekday = input()

if weekday == "SUN":
    print(7)
elif weekday == "MON":
    print(6)
elif weekday == "TUE":
    print(5)
elif weekday == "WED":
    print(4)
elif weekday == "THU":
    print(3)
elif weekday == "FRI":
    print(2)
elif weekday == "SAT":
    print(1)

Solution (Python):
S = input()

days = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - days.index(S))

Solution (Python):
s = ["SUN","MON","TUE","WED","THU","FRI","SAT"].index(input())
print(7-s)

Solution (Python):
s=input()
dict1={7:'SUN',6:'MON',5:'TUE',4:'WED',3:'THU',2:'FRI',1:'SAT'}
keys = [k for k, v in dict1.items() if v == s]
print(keys[0])

Solution (Python):
S = input()

if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
elif S == 'SAT':
    print(1)

Solution (Python):
S = input()

if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
elif S == 'SAT':
    print(1)

Solution (Python):
s = input()
if s == "SUN":
    print(7)
elif s == "MON":
    print(6)
elif s == "TUE":
    print(5)
elif s == "WED":
    print(4)
elif s == "THU":
    print(3)
elif s == "FRI":
    print(2)
elif s == "SAT":
    print(1)

Solution (Python):
S = str(input())

if S=="SUN":
    print(7)
elif S=="MON":
    print(6)
elif S=="TUE":
    print(5)
elif S=="WED":
    print(4)
elif S=="THU":
    print(3)
elif S=="FRI":
    print(2)
elif S=="SAT":
    print(1)

Solution (Python):
s = input()
l = ['SUN','MON','TUE','WED','THU','FRI','SAT']
i = 7-l.index(s)
print(i)

Solution (Python):
S=input()
if S=='SUN':
  print(7)
elif S=='MON':
  print(6)
elif S=='TUE':
  print(5)
elif S=='WED':
  print(4)
elif S=='THU':
  print(3)
elif S=='FRI':
  print(2)
elif S=='SAT':
  print(1)

Solution (Python):



S = input()



if S == 'SUN':
    
    answer = 7
elif S == 'MON':
    
    answer = 6
elif S == 'TUE':
    
    answer = 5
elif S == 'WED':
    
    answer = 4
elif S == 'THU':
    
    answer = 3
elif S == 'FRI':
    
    answer = 2
elif S == 'SAT':
    
    answer = 1

print(answer)

Solution (Python):


s = input()


if s == 'SAT':
    print(1)
elif s == 'FRI':
    print(2)
elif s == 'THU':
    print(3)
elif s == 'WED':
    print(4)
elif s == 'TUE':
    print(5)
elif s == 'MON':
    print(6)
elif s == 'SUN':
    print(7)

Solution (Python):


S = input()

if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
else:
    print(1)

Solution (Python):



S = input()



if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
elif S == 'SAT':
    print(1)

Solution (Python):
days = ["DAYS","SAT","FRI","THU","WED","TUE","MON","SUN"]
s = str(input())
for i in days:
    if i == s:
        print(days.index(i))
        break

Solution (Python):
S = input()

if S == 'SUN':
    print(7)

elif S == 'MON':
    print(6)

elif S == 'TUE':
    print(5)

elif S == 'WED':
    print(4)

elif S == 'THU':
    print(3)

elif S == 'FRI':
    print(2)

else:
    print(1)

Solution (Python):

s = input()
ans = 0
if s == 'SUN':
    ans = 7
elif s == 'MON':
    ans = 6
elif s == 'TUE':
    ans = 5
elif s == 'WED':
    ans = 4
elif s == 'THU':
    ans = 3
elif s == 'FRI':
    ans = 2
elif s == 'SAT':
    ans = 1
print(ans)

Solution (Python):
week_dict = {
    'MON': 1,
    'TUE': 2,
    'WED': 3,
    'THU': 4,
    'FRI': 5,
    'SAT': 6,
    'SUN': 7
}

day_of_week = input()

if day_of_week == 'SUN':
    print(week_dict[day_of_week])

else:
    days_left_to_sunday = 7 - week_dict[day_of_week]
    print(days_left_to_sunday)

Solution (Python):


S=input()
print()

if S=="SUN":
    print(7)
if S=="MON":
    print(6)
if S=="TUE":
    print(5)
if S=="WED":
    print(4)
if S=="THU":
    print(3)
if S=="FRI":
    print(2)
if S=="SAT":
    print(1)

Solution (Python):
S = input()
days = ['SUN','MON','TUE','WED','THU','FRI','SAT']

i = days.index(S)

print (7-i)

Solution (Python):
S = input()
lst = ['', 'SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON', 'SUN']
print(lst.index(S))

Solution (Python):
S = input()

if S == 'SUN' :
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
else :
    print(1)

Solution (Python):
day = input('')

if day == 'SUN':
    print('7')
elif day == 'MON':
    print('6')
elif day == 'TUE':
    print('5')
elif day == 'WED':
    print('4')
elif day == 'THU':
    print('3')
elif day == 'FRI':
    print('2')
else:
    print('1')

Solution (Python):

s=input()

if s=='MON':
  print(6)
elif s=='TUE':
  print(5)
elif s=='WED':
  print(4)
elif s=='THU':
  print(3)
elif s=='FRI':
  print(2)
elif s=='SAT':
  print(1)
else:
  print(7)

Solution (Python):

S = input()
L =["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
ct = L.index(S)
x = 7 - ct
print(x)

Solution (Python):
s=input()
if "M" in s:
    print("6")
elif "D" in s:
    print("4")
elif "E" in s:
    print("5")
elif "H" in s:
    print("3")
elif "F" in s:
    print("2")
elif "A" in s:
    print("1")
else:
    print("7")

Solution (Python):
days = {'SUN':7,'MON':6,'TUE':5,'WED':4,'THU':3,'FRI':2,'SAT':1}
print(days[input()])

Solution (Python):
s=input()
l=['SUN','MON','TUE','WED','THU','FRI','SAT']
d=[7,6,5,4,3,2,1]
print(d[l.index(s)])

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy








def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

s = input()
l = [ 'SUN','MON','TUE','WED','THU','FRI','SAT']
print(7 - l.index(s))

Solution (Python):


l = ['_', 'SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON', 'SUN']

s = input()

print(l.index(s))

Solution (Python):
S = str(input())
M = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

t = M.index(S)
print(7 - t)

Solution (Python):
Array =  ["SUN","MON","TUE","WED","THU","FRI","SAT"] 
S = input()

print(abs(Array.index(S)-7))

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

s = input()
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - day.index(s))

Solution (Python):
S = input()

d = {"SUN": 7, "MON":6, "TUE":5, "WED":4, "THU":3, "FRI":2, "SAT":1}
print(d[S])

Solution (Python):
a = input()
if a == "SUN":
  print(7)
elif a == "MON":
  print(6)
elif a == "TUE":
  print(5)
elif a == "WED":
  print(4)
elif a == "THU":
  print(3)
elif a == "FRI":
  print(2)
elif a == "SAT":
  print(1)

Solution (Python):
week = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - week.index(input()))

Solution (Python):
w = ["SAT", "FRI", "THU", "WED", "TUE", "MON", "SUN"]
s = input()
print((w.index(s)+1)%8)

Solution (Python):
A = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

P = input()
print(7-A.index(P))

Solution (Python):
week = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
s = input()
i = 1
while s != week[-i]:
    i = i + 1
print(int(i))

Solution (Python):

def main():
    s = input()
    week = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
    ind = week.index(s)
    print(7 - (ind % 7))


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
if S == 'SUN':
    print(7)
elif S == 'MON':
    print(6)
elif S == 'TUE':
    print(5)
elif S == 'WED':
    print(4)
elif S == 'THU':
    print(3)
elif S == 'FRI':
    print(2)
elif S == 'SAT':
    print(1)

Solution (Python):
W = [ "SUN","MON","TUE","WED","THU","FRI","SAT" ]
S = input()

for i in range(len(W)):
    if W[i]==S :
        break
print( 7-i )

Solution (Python):
S=input()
if S=="SUN":
  print(7)
if S=="MON":
  print(6)
if S=="TUE":
  print(5)
if S=="WED":
  print(4)
if S=="THU":
  print(3)
if S=="FRI":
  print(2)
if S=="SAT":
  print(1)

Solution (Python):
n = input()
daylist = {'SUN':7,'MON':6,'TUE':5,'WED':4,'THU':3,'FRI':2,'SAT':1}

print(daylist[n])

Solution (Python):
S = input()

week = ['SUN','MON','TUE','WED','THU','FRI','SAT']

day = [7, 6, 5, 4, 3, 2, 1]

ans = week.index(S)

print(day[ans])

Solution (Python):
s = input()
if s == "SUN":
  print(7)
elif s == "MON":
  print(6)
elif s == "TUE":
  print(5)
elif s == "WED":
  print(4)
elif s == "THU":
  print(3)
elif s == "FRI":
  print(2)
else:
  print(1)

Solution (Python):
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    S = input()
    X = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

    for i in range(len(X)):
        if S == X[i]:
            print(7-i)






if __name__ == "__main__":
    main()

Solution (Python):
s = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7-s.index(input()))

Solution (Python):
days = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
s = str(input())
for i in range(7):
    if s == days[i]:
        print(7 - i)
        exit()

Solution (Python):
week = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
S = input()

ans = 7
for i in range(len(week)):
    if S == week[i]:
        ans -= i
        
print(ans)

Solution (Python):
S = input()
W = ['SUN','MON','TUE','WED','THU','FRI','SAT']
w = W.index(S)
print(7 - w)

Solution (Python):
S = input()

if S == "SAT":
    print("1")
elif S == "FRI":
    print("2")
elif S == "THU":
    print("3")
elif S == "WED":
    print("4")
elif S == "TUE":
    print("5")
elif S == "MON":
    print("6")
else:
    print("7")

Solution (Python):
w = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
w.reverse()
print(w.index(input())+1)

Solution (Python):
S=input()
date=['SUN','MON','TUE','WED','THU','FRI','SAT']

i=date.index(S)
print(7-i)

Solution (Python):
week = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7 - week.index(input()))

Solution (Python):
s=str(input())
w=["SUN","MON","TUE","WED","THU","FRI","SAT"]
for i in range(7):
    if w[i]==s:
        print(7-i)
        break

Solution (Python):
day = ['','SAT','FRI','THU','WED','TUE','MON','SUN']
s = str(input())
for i in range(8):
    if s==day[i]:
        break
print(i)

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

    d = ('SUN' ,'MON' ,'TUE' ,'WED' ,'THU' ,'FRI' ,'SAT')

    ans = 7 - d.index(S)
    print(ans)

if __name__ == '__main__':
    resolve()

Solution (Python):
s = str(input())
a = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - a.index(s))

Solution (Python):
S = str(input())
days = ['SUN','MON','TUE','WED','THU','FRI','SAT' ]
print(7-days.index(S))

Solution (Python):
S=input()
lis=['SUN','MON','TUE','WED','THU','FRI','SAT']
i=lis.index(S)
if S=='SUN':
    print(7)
else:
    for j in range(1,8):
        if lis[i-j]=='SUN':
            print(7-j)
            break

Solution (Python):
s = input()

d = {
    "SUN": 7,
    "MON": 6,
    "TUE": 5,
    "WED": 4,
    "THU": 3,
    "FRI": 2,
    "SAT": 1
}

print(d[s])

Solution (Python):
s = input()
x = 7
if s == "SUN":
    pass
elif s == "SAT":
    x = x - 6
elif s == "FRI":
    x = x - 5
elif s == "THU":
    x = x - 4
elif s == "WED":
    x = x - 3
elif s == "TUE":
    x = x - 2
elif s == "MON":
    x = x - 1


print(x)

Solution (Python):
import sys
input = sys.stdin.readline

day = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

s = input()[:-1]

print(7-day.index(s))

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)
INF =  float("inf")
import bisect

S = input()

if S == "SUN":
    print(7)
elif S == "MON":
    print(6)
elif S == "TUE":
    print(5)
elif S == "WED":
    print(4)
elif S == "THU":
    print(3)
elif S == "FRI":
    print(2)
elif S == "SAT":
    print(1)

Solution (Python):
S = input()
Date = ["SUN", 'MON', "TUE", "WED", "THU", "FRI", "SAT"][::-1]

print(Date.index(S)+1)

Solution (Python):
weeks = ("SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT")
s = input()
print(7 - weeks.index(s))

Solution (Python):
dic={"SUN":7, "MON":6, "TUE":5, "WED":4, "THU":3, "FRI":2, "SAT":1}

s=input()
print(dic[s])

Solution (Python):
S = input()

DAY = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

print(7-DAY.index(S))

Solution (Python):
youbi = ['SUN','MON','TUE','WED','THU','FRI','SAT']
y = input()

for i in range(7):
  if y == youbi[i]:
    print(7-i)

Solution (Python):
s = input()
w = ['SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON', 'SUN']
print(w.index(s)+1)