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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

for i in range(7):
	if day[i] == S:
		print(7-i)
		sys.exit()

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)
elif s=='SUN':
  print(7)

Solution (Python):

s = input()

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

print(m[s])

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  l=['SUN','MON','TUE','WED','THU','FRI','SAT']
  s=S()
  t=l.index(s)
  return 7-t


print(main())

Solution (Python):
import sys

S = input()

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

for i in range(7):

    if lis[i] == S:
        print (7 - i)
        sys.exit()

Solution (Python):
s = input()

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

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    ans = {
        'SUN': 7,
        'MON': 6,
        'TUE': 5,
        'WED': 4,
        'THU': 3,
        'FRI': 2,
        'SAT': 1,
    }
    s = input()
    print(ans[s])


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):
s2i = {s:i for i, s in enumerate(["SUN","MON","TUE","WED","THU","FRI","SAT"])}
S = input()
print(7-s2i[S])

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

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

Solution (Python):
S = input()
if S == "SAT":
  print(1)
elif 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)

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

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

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

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

Solution (Python):

s = input()

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

print(days[s])

Solution (Python):
S = ['SUN','MON','TUE','WED','THU','FRI','SAT']
k = input()
for i in range(7):
  if S[i] == k:
    print(7-i)

Solution (Python):
s = input()

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):
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):
print 7-["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"].index(raw_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 == "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):
x = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
day = input().strip()
print(7 - x.index(day))

Solution (Python):
S = input()
D = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
D = list(reversed(D))
for i,d in enumerate(D):
    if S==d:
        break
print(i+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())
a = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
for i in range(7):
    if s==a[i]:
        print(7-i)

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()
yobi=["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7-yobi.index(s))

Solution (Python):
x = 'SUN,MON,TUE,WED,THU,FRI,SAT'.split(',')

s = input()
idx = x.index(s)

print(7 - idx)

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()
d = {"SAT":1, "FRI":2, "THU":3, "WED":4, "TUE":5, "MON":6, "SUN":7}
print(d[s])

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

Solution (Python):


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

S=input()

for index,item in enumerate(l):
    if item==S:
        print(7-index)

Solution (Python):
s = input()

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

print(s_dic[s])

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

Solution (Python):

import sys
input = sys.stdin.readline
INF = 10**9

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

Solution (Python):
s = input()

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

for i in range(8):
    if s == wd[i]:
        print(i)

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

Solution (Python):
S = input()
a = ['SUN','MON','TUE','WED','THU','FRI','SAT']
print({key:7-i for i, key in enumerate(a)}[S])

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

Solution (Python):

import sys


def solve(S: str):
    a = {'SUN':7,'MON':6,'TUE':5,'WED':4,'THU':3,'FRI':2,'SAT':1}
    print(a[S])
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

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()
d = {"SUN": 7,
     "MON": 6,
     "TUE": 5,
     "WED": 4,
     "THU": 3,
     "FRI": 2,
     "SAT": 1
     }
print(d[s])

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

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

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

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

Solution (Python):
S = input()

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)
if 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)

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 == 'SAT':
    print(1)
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)

Solution (Python):
s = input()

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

Solution (Python):






S = input()




if S == 'SAT' :
    print(1)
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 == 'SUN' :
    print(7)

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

Solution (Python):
S = input()

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

print(7 - l.index(S))

Solution (Python):

from collections import defaultdict


def getlist():
	return list(map(int, input().split()))


def main():
	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)
	


if __name__ == '__main__':
	main()

Solution (Python):
S = input()
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
else:
    ans = 1
    
print(ans)

Solution (Python):
S = input()

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

Solution (Python):
import queue
import math
import copy
"""
N = int(input())



A = []
for i in range(N):
	A.append(int(input()))

print(A)

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

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()

P = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
ans = 7- P.index(S)
print(ans)

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

Solution (Python):




def main():
  v = input().strip()
  i = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT'].index(v)

  print(7 - i)


if __name__ == '__main__':
  main()

Solution (Python):
from sys import stdin

S = stdin.readline().rstrip()

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

print(7 - days.index(S))

Solution (Python):
s=input()
dic={"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
print(dic[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)
elif s == "SAT":
    print(1)

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

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

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

Solution (Python):

import sys


def solve(S: str):
    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)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

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

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    return


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

if __name__ == '__main__':
    main()

Solution (Python):
print({s:7-i for i,s in enumerate(['SUN','MON','TUE','WED','THU','FRI','SAT'])}[input()])

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

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

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

Solution (Python):
a = 'SUN,MON,TUE,WED,THU,FRI,SAT'.split(',')
b = input()
for i, v in enumerate(a):
    if v == b:
        print(7 - i)
        exit()

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

Solution (Python):
l=["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
s=input()
i=l.index(s)
print(7-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):

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

Solution (Python):
S = input()
if S == "SAT":
    print(1)
elif 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)

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

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

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

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

Solution (Python):
S = input()
D = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
i = D.index(S)
print(len(D) - i)

Solution (Python):
d=dict()
d["SUN"]=7
d["MON"]=6
d["TUE"]=5
d["WED"]=4
d["THU"]=3
d["FRI"]=2
d["SAT"]=1
print(d[input()])

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()
day = {'SUN':7,'MON':6,'TUE':5,'WED':4,'THU':3,'FRI':2,'SAT':1}
print(day[S])

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    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)
resolve()

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()
res = {
    'SUN': 7,
    'MON': 6,
    'TUE': 5,
    'WED': 4,
    'THU': 3,
    'FRI': 2,
    'SAT': 1
}

print(res[s])

Solution (Python):
s=input()
t=["SUN","MON","TUE","WED","THU","FRI","SAT"]
i=t.index(s)
print(7-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):
import sys

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

d = {
    'SUN': 7,
    'MON': 6,
    'TUE': 5,
    'WED': 4,
    'THU': 3,
    'FRI': 2,
    'SAT': 1,
}
s = rs()
print(d[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):


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)
elif s == 'SAT':
    print(1)

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)

    
    yo = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
    
    s = input()[:-1]
    if yo.index(s) == 0:
        print(7)
    else:
        print(7-yo.index(s))


if __name__ == '__main__':
    main()

Solution (Python):
s=input()

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):
S = input()
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):
s=input()
tr = {
  "SAT": 1,
  "FRI": 2,
  "THU": 3,
  "WED": 4,
  "TUE": 5,
  "MON": 6,
  "SUN": 7
}
print(tr[s])

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    s = input()
    f = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
    for i in range(7):
        if f[i] == s:
            break
    print(7-i)
    return


if __name__ == "__main__":
    solve()

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

Solution (Python):
S = input()
li=['SU','MO','TU','WE','TH','FR','SA']
a = li.index(S[:2])
if(a == 0):
    print(7)
else:
    print(7-a)

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

Solution (Python):
s = input()

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

Solution (Python):
X = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
S = input()
print(7 - X.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)
elif s=='SAT':
    print(1)

Solution (Python):
s=input()
l = ['SUN','MON','TUE','WED','THU','FRI','SAT']
i = 7
for x in l:
    if x == s:
        print(i)
        break
    i-=1

Solution (Python):
SUN,MON,TUE,WED,THU,FRI,SAT = 0,1,2,3,4,5,6
print(7-eval(input()))

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

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

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

id = tmp.index(S)
print(7 - id)

Solution (Python):
import sys
import collections


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    d = collections.defaultdict(int)
    d["SUN"] = 7
    d["MON"] = 6
    d["TUE"] = 5
    d["WED"] = 4
    d["THU"] = 3
    d["FRI"] = 2
    d["SAT"] = 1
    print(d[str(readline().rstrip().decode('utf-8'))])


if __name__ == '__main__':
    solve()

Solution (Python):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

S=one_str()

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

print(dicts[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):
S = input()
ans = {"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
print(ans[S])

Solution (Python):
s=input()
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):
def main():

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

if __name__ == '__main__':
    print(main())

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



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)
else:
    pass

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

Solution (Python):
S = input()

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

print(7-T.index(S))

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

main()

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

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

we = "SUN,MON,TUE,WED,THU,FRI,SAT".split(",")
s = ns()
for i in range(7):
    if s == we[i]:
        print(7-i)

Solution (Python):


def a():
    day = input()

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

    print(7 - week[day])



if __name__ == "__main__":
    a()

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

Solution (Python):
S = input()

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

print(T[S])

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

print(ans[S])

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

Solution (Python):
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


S = sys.stdin.buffer.readline().decode().rstrip()
i = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT'].index(S)
print(7 - i)

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

S = input()[:-1]

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

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