Problem:
 Score : 100 points    Problem Statement Given is a three-digit integer N . Does N contain the digit 7 ?  If so, print Yes ; otherwise, print No .      Constraints  100 \leq N \leq 999         Input Input is given from Standard Input in the following format:  N       Output If N contains the digit 7 , print Yes ; otherwise, print No .        Sample Input 1 117      Sample Output 1 Yes  117 contains 7 as its last digit.       Sample Input 2 123      Sample Output 2 No  123 does not contain the digit 7 .       Sample Input 3 777      Sample Output 3 Yes

Solution (Python):
import sys
from io import StringIO
import unittest

def resolve():
    n = input()

    if n[0] == "7":
        print("Yes")
        return
    if n[1] == "7":
        print("Yes")
        return
    if n[2] == "7":
        print("Yes")
        return
    print("No")
    return
class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """117"""
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """123"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """777"""
        output = """Yes"""
        self.assertIO(input, output)

if __name__ == "__main__":
    
    resolve()

Solution (Python):
a = input()

flag = False
for item in a:
	if item == "7":
		print("Yes")
		flag = True
		break


if not flag:
	print("No")

Solution (Python):
input_str = input()
seven_flag = False
for i in range(len(input_str)):
  if input_str[i] == '7':
    seven_flag = True
    break
if seven_flag:
  print("Yes")
else:
  print("No")

Solution (Python):
n = input().rstrip('\n');

ans = 0;
for i in range(len(n)) :
    if int(n[i]) == 7 :
        ans = 1;

if ans :
    print('Yes');
else :
    print('No');

Solution (Python):
N = input()
if N[0] == "7" or N[1] == '7' or N[2] == "7":
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
for i in n:
    if i == '7':
        print('Yes')
        exit()
print('No')

Solution (Python):
def resolve():
	w = input()
	if w.find("7") > -1:
		print("Yes")
	else:
		print("No")
resolve()

Solution (Python):
N = str(input())
a=1
for i in range(len(N)):
    if N[i]=='7':
        a=0
        break
if a==0:
    print('Yes')
else:
    print('No')

Solution (Python):
from sys import exit
for x in input():
    if x == "7":
        print("Yes")
        exit()
print("No")

Solution (Python):
n = list(input())
print("Yes" if '7' in n else "No")

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

A = "No"

if N[0] == "7" or N[1] == "7" or N[2] == "7":
  A = "Yes"
print(A)

Solution (Python):
n = list(input())

if "7" in n:
    print("Yes")
else :
    print("No")

Solution (Python):
N = input()
if N.count('7'):
    print('Yes')
else:
    print('No')

Solution (Python):
N=list(input())

if '7'in N:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
N = list(N)
Flag = False
for i in range(len(N)) :
    if N[i] == '7' :
        print("Yes")
        Flag = True
        break

if Flag == False :
    print("No")

Solution (Python):
n=input()
ans="No"
if n[0]=="7" or n[1]=="7" or n[2]=="7":
    ans="Yes"
print(ans)

Solution (Python):
s = input()

truf = False
for i in s:
  if i == "7":
    truf = True
    
if truf:
  print("Yes")
else:
  print("No")

Solution (Python):
n =input()


if str(n).find("7") != -1:
    print("Yes")
else:
    print("No")

Solution (Python):
n = list(input())
if '7' in n:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()

if "7" in N:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if "7" in n:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input().strip())

for i in range(3):
    if n%10==7:
        print("Yes")
        exit()
    else:
        n//=10
print("No")

Solution (Python):
n=input()
if '7' in n:
     print("Yes")
else:
  	print("No")

Solution (Python):
s=list(input())
if '7' in s:
    print('Yes')
else:
    print('No')

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

suhji = set(n)

if '7' in suhji:
    print('Yes')
else:
    print('No')

Solution (Python):


def main():

    s = input()
    flag = any([True for x in s if x == '7'])
    
    if flag:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Solution (Python):
n = input() 



if '7' in n:
    print('Yes')
else:
    print('No')

Solution (Python):
n = str(input())
if "7" in n:
  print("Yes")
else:print("No")

Solution (Python):

get = input()
if '7' in get:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
if n[0] == "7" or n[1] == "7" or n[2] == "7":
  print("Yes")
else:
  print("No")

Solution (Python):


from sys import stdin


A = list(input())

if '7' in A:
    print('Yes')
else:
    print('No')

Solution (Python):
s = list(str(input()))
ans = "No"

for i in range(3):
  if s[i] == '7':
    ans = 'Yes'
print(ans)

Solution (Python):
n = input()
if "7" in n:
    print('Yes')
else:
    print('No')

Solution (Python):
n = list(input())
if "7" in n :
    print("Yes")
else :
    print("No")

Solution (Python):
N=int(input())
flag=False
if N%10==7:
    flag=True
elif N//10%10==7:
    flag = True
elif N//100%10==7:
    flag = True
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
N = [int(i) for i in input()]

if 7 in N:
    print("Yes")
else:
    print("No")

Solution (Python):

N = input()
print('Yes' if N.find('7') != -1 else 'No')

Solution (Python):
n = list(input())
if "7" in n:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, gcd
from functools import lru_cache, reduce
INF = 1 << 60
mod = 1000000007
sys.setrecursionlimit(10 ** 7)


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def dijkstra_heap(s, edge, n):
    
    d = [10**20] * n
    used = [True] * n 
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def lcm_list(numbers):
    return reduce(lcm, numbers, 1)


def gcd_list(numbers):
    return reduce(gcd, numbers)


n = input()
yes = False
for i in n:
    if i == "7":
        yes = True
        break
if yes:
    print("Yes")
else:
    print("No")

Solution (Python):
N=input()

if(N[0]=="7"):
  print("Yes")
elif(N[1]=="7"):
  print("Yes")
elif(N[2]=="7"):
  print("Yes")
else:
  print("No")

Solution (Python):
n = input()
nn = list(n)
for i in nn:
    if i == '7':
        print('Yes')
        exit()
print('No')

Solution (Python):
N = input()
if N[0] == '7' or N[1] == '7' or N[2] == '7':
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
input = sys.stdin.readline
from itertools import *
from functools import *
from collections import *
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1


def number2digits(number):
    return list(map(int, str(number)))


def main():
    N = int(input())
    num_ls = number2digits(N)

    if 7 in num_ls:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
n = input()

flag = False
for i in range(len(n)):
    if n[i] == str(7):
        flag = True
        break

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

ans = 0
for i in range(3):
    if N[i] == '7':
        ans += 1
    else:
        pass

if ans > 0:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
for i in range(len(s)):
    if s[i] =="7":
        print("Yes")
        break
else:
    print("No")

Solution (Python):
N = input()

for n in N:
    if n == '7':
        print("Yes")
        break
else:
    print("No")

Solution (Python):
N = input()

ans = "No"
for i in range(3):
    if N[i] == "7":
        ans = "Yes"
        print(ans)
        break

if ans == "No":
    print(ans)

Solution (Python):
n = input()
if "7" in n:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
flag =False
for i in N:
    if i=='7':
        flag = True
print('Yes' if flag ==True else 'No')

Solution (Python):
N = list(input())
if '7' in N:
	print('Yes')
else:
	print('No')

Solution (Python):
a = list(input())
if(a.count('7') > 0):
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

if __name__ == "__main__":
    N = list(input())
    
    for n in N:
        if n == '7':
            print("Yes")
            sys.exit()
    print('No')

Solution (Python):
input_ = input()

if "7" in input_:
    print("Yes")
else:
    print("No")

Solution (Python):
a = input()
cunt = 0
for i in a:
    if i == "7":
        print("Yes")
        break
    else:
        cunt += 1
if cunt == 3:
    print("No")

Solution (Python):
n=input()
ans=0
for i in range(len(n)):
    if n[i]=='7':
        ans=1
if ans==0:
    print('No')
else:
    print('Yes')

Solution (Python):

N = int(input())
N = str(N)
flag = 0
for i in N:
    if i == "7":
        flag = 1
if flag == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if '7' in n:
  print('Yes')
else:
  print('No')

Solution (Python):
N = input()

f = False
for i in N:
    if i == '7':
        f = True
        break
if f:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())

result = "No"
if (N >=700 and N<800):
	result = "Yes"

if (N%100 >= 70 and N%100 < 80):
	result = "Yes"

if (N%10 >= 7 and N%10 < 8):
	result = "Yes"

print(result)

Solution (Python):
a=str(input())
if "7"in a:
    print("Yes")
else:
    print("No")

Solution (Python):
a=str(input())
print("Yes" if a[0]=="7" or a[1]=="7" or a[2]=="7" else "No")

Solution (Python):
a=input()

if a.find('7') == -1:print('No')
else: print('Yes')

Solution (Python):
n = input()
if '7' in n:
	print('Yes')
else:
	print('No')

Solution (Python):
n = input()
if "7" in n:
    print("Yes")
else:
    print("No")

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

if(s[0]=='7'): print('Yes')
elif(s[1]=='7'): print('Yes')
elif(s[2]=='7'): print('Yes')
else: print('No')

Solution (Python):
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

n = ins()
if n[0]=='7' or n[1]=='7' or n[2]=='7':
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
for i in range(len(N)):
    if N[i] == "7":
        print("Yes")
        exit()
    else:
        continue

print("No")

Solution (Python):
N = input()

if '7' in N:
  print('Yes')
else:
  print('No')

Solution (Python):
N = list(input())

flag = False
for i in range(len(N)):
    if N[i] == '7':
        flag = True

if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if '7' in s:
	print('Yes')
else:
	print('No')

Solution (Python):
N=int(input())
ans='No'
for i in range(3):
  if N%10==7:
    ans='Yes'
    break
  else:
    N //=10
print(ans)

Solution (Python):
import sys

input_line = input()
Line = list(input_line)



for i in Line:
    if i == "7":
        print("Yes")
        sys.exit()

print("No")

Solution (Python):
S  = input()
flag = "No"
for i in S:
    if i == "7":
        flag = "Yes"

print(flag)

Solution (Python):


def main():
    n = input()
    ret = 'No'
    for i in range(3):
        if n[i] == '7':
            ret = 'Yes'

    print(ret)

if __name__ == '__main__':
    main()

Solution (Python):
N = list(input())
if "7" in N:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()

if '7' in n:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()
tf = False
for n in N:
  if n == "7":
    tf = True
    break
if tf == True:
  print("Yes")
else:
  print("No")

Solution (Python):
N = input()
if '7' in N:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

if N[2] == '7' or N[1] == '7' or N[0] == '7':
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
if "7" in s:print("Yes")
else:print("No")

Solution (Python):
N = input()
if N.count("7") == 0:
	print("No")
else:
	print("Yes")

Solution (Python):
n = input()
if '7' in n:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
def solve(n):
	return n % 10 == 7 or (n // 10) % 10 == 7 or (n // 100) % 10 == 7
if solve(n):
	print('Yes')
else:
  	print('No')

Solution (Python):
S = input()
if int(S[0]) == 7 or int(S[1]) == 7 or int(S[2]) == 7:
	print("Yes")
else:
	print("No")

Solution (Python):
from sys import stdin, stdout
def main():
    n=stdin.readline().rstrip()
    if '7' in n:
        print('Yes')
        return
    print('No')
    return
main()

Solution (Python):
num=input()
if("7" in num):
    print("Yes")
else:
    print("No")

Solution (Python):
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, product, accumulate, groupby
from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)


inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]
ddn9 = ddn + [(0, 0)]
'''for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:'''
"""
import sys
sys.setrecursionlimit(10 ** 7)


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



def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]


def ws(): return sys.stdin.readline().split()


def si(): return int(sys.stdin.readline())  


def ss(): return input()


def hi(n): return [si() for _ in range(n)]


def hs(n): return [ss() for _ in range(n)]  


def s_list(): return list(input())


def mi(n): return [wi() for _ in range(n)]  


def mip(n): return [wip() for _ in range(n)]


def ms(n): return [ws() for _ in range(n)]


def num_grid(n): return [[int(i) for i in sys.stdin.readline().split()[
    0]] for _ in range(n)]  


def grid(n): return [s_list() for _ in range(n)]


def main():
    N = si()
    n = str(N)
    for i in range(3):
        if n[i] == '7':
            print('Yes')
            sys.exit()
    print('No')


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
if N//100 == 7 or (N//10)%10 == 7 or N%10 == 7:
    print("Yes")
else:
    print("No")

Solution (Python):
S = list(input())
if "7" in S:
    print("Yes")
else:
    print("No")

Solution (Python):

from sys import stdin
from operator import itemgetter
from collections import deque
import math
import pprint


def keta(kazu):
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

s = stdin.readline().rstrip()

if s[0]=='7' or s[1]=='7' or s[2]=='7':
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
a = N % 10
A = N // 10
b = A % 10
c = A // 10
if a == 7 or b == 7 or c == 7:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
if '7' in n:
  print('Yes')
else:
  print('No')

Solution (Python):
def main():
  data = list(input())
  for d in data:
    if d == "7":
      print("Yes")
      return

  print("No")

if __name__ == "__main__":
  main()

Solution (Python):
N = input()

if '7' in N:
  print('Yes')
else:
  print('No')

Solution (Python):
n = str(input())
if n[0] == '7' or n[1] == '7' or n[2] == '7':
    print('Yes')
else:
    print('No')

Solution (Python):
n = list(str(input()))



if "7" in n:
    print('Yes')
else:
    print("No")

Solution (Python):
N = input()

if N[0] == "7" or N[1] == "7" or N[2] == "7":
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
    N = input()
    for i in N:
        if i == "7":
            print("Yes")
            return
    print("No")

main()

Solution (Python):
N = int(input())

a_100 = N // 100
N = N - 100 * a_100

a_10 = N // 10
N = N - 10 * a_10

a_1 = N

if a_100 == 7 or a_10 == 7 or a_1 == 7:
    print('Yes')

else:
    print('No')

Solution (Python):
N=input()
f=False
for i in range(3):
    if N[i]=="7":
        f=True

if f==True:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
l = list(n)
check = False
for i in l:
  if int(i)==7:
    check = True
    break
if check:
  print("Yes")
else:
  print("No")

Solution (Python):
s=input();print("Yes" if "7" in s else "No")

Solution (Python):
N = input()

if '7' in N:
    print('Yes')
else:
    print('No')

Solution (Python):
N=str(input())
FLAG=0
for i in N:
    if i=='7':
        FLAG=1
        break
if FLAG==1:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()

if '7' in n:
  print('Yes')
else:
  print('No')

Solution (Python):
N = input()

is_true = False
for n in N:
    if int(n) == 7:
        is_true = True
        break
if is_true:
    print('Yes')
else:
    print('No')

Solution (Python):
n=input()
print('Yes' if '7' in n else 'No')

Solution (Python):
n = input()
if "7" in n:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if "7" in n:
    print("Yes")
else:
    print("No")

Solution (Python):
n=list(input())
c = n.count("7")

if c == 0:
    print("No")
else:
    print("Yes")

Solution (Python):
n=list(input())
if "7" in n:
	print("Yes")
else:
	print("No")

Solution (Python):
s=list(input())
if s.count("7")>=1:
  print('Yes')
else:
  print('No')

Solution (Python):
from sys import stdin

N= list(stdin.readline().strip())
flag=0
for i in N:
    if i=='7':flag=1
if flag==1: print("Yes")
else:print("No")

Solution (Python):
S=input()
if S[0]=="7" or S[1]=="7" or S[2]=="7":
    print("Yes")
else:
    print("No")

Solution (Python):
if __name__ == "__main__":
    n = int(input())
    result = False
    while True:
        if n % 10 == 7:
            result = True
        n //= 10
        if n == 0:
            break

    if result:
        print('Yes')
    else:
        print('No')

Solution (Python):
N = input()

if N[0] == '7' or N[1] == '7' or N[2] == '7':
  print('Yes')
else:
  print('No')

Solution (Python):

N, = ((x) for x in input().split())

if '7' in N:
    print('Yes')
else:
    print('No')

Solution (Python):

N = str(input())

print("Yes" if N.count("7") > 0 else "No")

Solution (Python):
N = list(input())
if '7' in N:
    print('Yes')
else:
    print('No')

Solution (Python):
a=input()

b=a.find("7")

if b==-1:
    print("No")
else:
    print("Yes")

Solution (Python):
N = input()
if "7" in N:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

for i in N:
    if i == "7":
        print("Yes")
        exit()
print("No")

Solution (Python):
N = input()
if '7' in N:
    print('Yes')
else:
    print('No')

Solution (Python):
print(["No","Yes"]["7" in input()])

Solution (Python):
import sys


def in_ctrl():
    _input = [_.rstrip() for _ in sys.stdin.readlines()]
    
    N = int(_input[0])
    
    return N


def out_ctrl(s):
    print(s)


if __name__ == "__main__":
    N = in_ctrl()
    
    n = list(map(int,list(str(N))))
    flag = False
    for _ in n:
        if _ == 7:
            flag=True
            break
    s = 'Yes' if flag else 'No'
    
    out_ctrl(s)

Solution (Python):
N = input()

if '7' in list(N):
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
a = 0
for i in range(len(s)):
    if (s[i] == '7'):
        print("Yes") 
        a = 1
        break
if(a == 0):
    print("No")

Solution (Python):
import sys
N = list(map(int, input()))
for n in N:
    if n == 7:
        print("Yes")
        sys.exit()
print("No")

Solution (Python):
n = input()

if n[0] == '7' or n[1] == '7' or n[2] == '7':
    print('Yes')
else:
    print('No')

Solution (Python):
'''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools

num = stdin.readline().rstrip()
if '7' in num:
    print('Yes')
else:
    print('No')

Solution (Python):
X = input()
contains = "No"
for i in range(len(X)):
    if X[i] == "7":
        contains = "Yes"
print(contains)

Solution (Python):
n = input()
if "7" in n:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
flg = 0
for i in range(len(n)):
    if n[i] == "7":
        flg = 1
if flg == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
print('YNeos'['7' not in input()::2])

Solution (Python):
s = input()
for i in s:
  if i=='7':
    print("Yes")
    break
else:
  print("No")

Solution (Python):
N = input()
if "7" in N:
  print("Yes")
else:
  print("No")

Solution (Python):
N = list(input())
ans = "No"
if "7" in N:
    ans = "Yes"

print(ans)

Solution (Python):
N = input()

result = False
for n in N:
  if (n == '7'):
    result = True
    break

s_res = 'Yes' if (result) else 'No'
print(s_res)

Solution (Python):
import sys
N = input()
for i in range(3):
    if N[i] == "7":
        print("Yes")
        sys.exit()
print("No")

Solution (Python):
n = input()
if n.count('7')==0:
    print("No")
else:
    print("Yes")

Solution (Python):
n=input()
if '7' in n:
	print('Yes')
else:
	print('No')

Solution (Python):
def main():
    a = input()
    if '7' in a:
        print("Yes")
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
n = input()
seven = False
for s in n:
    if s == '7':
        seven = True
        break

if seven:
    print('Yes')
else:
    print('No')

Solution (Python):
N = list(input())
if("7" in N):
    print("Yes")
else:
    print("No")

Solution (Python):


n=int(input())
s=list(str(n))
if '7' in s:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()

for i in n:
    if i == '7':
        print('Yes')
        break
else:
    print('No')

Solution (Python):
N = list(input())
if "7" in N:
    print("Yes")
    
else:
    print("No")

Solution (Python):
n = input()
ans = 0
for i in n:
    if i == '7':
        ans = 1
if ans == 1:
    print('Yes')
    
else:
    print('No')

Solution (Python):
def main():
    n = list(input())
    ans = [i=="7" for i in n]
    if any(ans):
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Solution (Python):
import sys
K=str(input())
K=list(K) 
K=[int(i) for i in K]

for i in K:
    if i==7:
        print("Yes")
        sys.exit()
print("No")

Solution (Python):
n = input()
print("Yes" if n[0]=='7' or n[1]=='7' or n[2]=='7' else "No")

Solution (Python):
N=list(input())
if "7" in N:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()

if "7" in n :
    print("Yes")
else:
    print("No")

Solution (Python):
a=input()
flag=False
for i in a :
  if i=='7' :
    flag=True
    break
if flag :
  print('Yes')
else :
  print('No')

Solution (Python):
N = str(input())
if N[0] == '7' or N[1] == '7' or N[2] == '7':
    print('Yes')
else:
    print('No')

Solution (Python):
x = input()
if x.count("7") != 0:
  print("Yes")
else:
  print("No")

Solution (Python):
m = 0
N = input()
for i in range(len(N)):
    if N[i] == '7':
        print('Yes')
        m += 1
        break
if m == 0:
    print("No")

Solution (Python):
N=input()
a = 0
for s in N:
    if s == "7":
        a = 1
if a == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()

if '7' in n:
    print('Yes')
else:
    print('No')

Solution (Python):
N  = list(input())
flag = False
for i in range(len(N)):
    if N[i] == "7" and flag == False:
        print("Yes")
        flag = True
if flag == False:
    print("No")

Solution (Python):
from collections import deque, Counter
from itertools import chain, combinations
import json
import numpy as np
import bisect
import sys

sys.setrecursionlimit(10 ** 8)


M = 10 ** 9 + 7


def main():
    N = input()
    print('Yes' if '7' in N else 'No')
    
    




if __name__ == "__main__":
    main()

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

if "7" in N:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if '7' in n:
    print('Yes')
else:
    print('No')

Solution (Python):
N = str(input())
if "7" in N:
  print("Yes")
else:
  print("No")

Solution (Python):
n = input()
if "7" in n:
    print("Yes")
else:
    print("No")

Solution (Python):
n=input()
ans="No"
for i in range(3):
    if n[i]=="7":
        ans="Yes"
print(ans)

Solution (Python):
n = input()

flg = False
for num in n:
    if num == '7':
        flg = True
        
if flg:
    print('Yes')
else:
    print('No')

Solution (Python):
n=input()
if "7" in n:
    print("Yes")
else:
    print("No")

Solution (Python):
n=input()
if n[0] == "7" or n[1]=="7" or n[2]=="7":
  print('Yes')
else:
  print('No')

Solution (Python):
n=input()
for i in n:
    if i == '7':
        print("Yes")
        exit()
print("No")

Solution (Python):


n = input()

if (n[0] != '7') and (n[1] != '7') and (n[2] != '7'):
    print('No')

else:
    print('Yes')

Solution (Python):
N = input()
a = int(N[0])
b = int(N[1])
c = int(N[2])
if a == 7 or b == 7 or c == 7:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if n[0]=='7':
  print('Yes')
  exit()
if n[1]=='7':
  print('Yes')
  exit()
if n[2]=='7':
  print('Yes')
  exit()
print('No')

Solution (Python):
N = input()

if '7' in N:
    print("Yes")
else:
    print("No")

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq









N = str(input())
ans = "No"

if(N[0] == "7" or N[1] == "7" or N[2] == "7"):
  ans = "Yes"
print(ans)

Solution (Python):
s=input().rstrip()
x=list(s)
if "7" in x:
  print("Yes")
else:
  print("No")

Solution (Python):
S=input()
a=0
for i in range(len(S)):
    if S[i]=='7':
        a=1
if a==1:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
flag = 0
for i in N:
    if i == "7":
        flag = 1
if flag == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
n=input()
if '7' in n:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if s[0] == '7':
    print('Yes')
    exit()
elif s[1] == '7':
    print('Yes')
    exit()
elif s[2] == '7':
    print('Yes')
    exit()
print('No')

Solution (Python):
N = input()

flag = 0

if N[0] == '7':
    flag = 1
if N[1] == '7':
    flag = 1
if N[2] == '7':
    flag = 1

if flag == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input())
if n//100==7 or (n//10)%10==7 or n%10==7:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    n=SI()
    if "7" in n:print("Yes")
    else:print("No")

main()

Solution (Python):
if '7' in str(input()):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
n_100 = n // 100
n_10 = (n-n_100*100) // 10
n_1 = n-n_100*100-n_10*10

if n_100==7 or n_10==7 or n_1==7:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
res = False
for c in s:
  if c == '7':
    res = True
    break
if res:
  print('Yes')
else:
  print('No')

Solution (Python):
a = input()

if a[0] == '7' or a[1] == '7' or a[2] == '7':
	print("Yes")
else:
	print("No")

Solution (Python):

n = input()
try:
    a = n.index("7")
    print("Yes")
except:
    print("No")

Solution (Python):
N =input()
if(N[0]=="7" or N[1]=="7" or N[2]=="7"):
  print("Yes")
else:
  print("No")

Solution (Python):
N=input()

re=0
for i in range(3):
    if N[i] == '7':
        re=1

if re==0:
    print('No')
else:
    print('Yes')

Solution (Python):

N = str(input())
if N[0] == "7" or N[1] == "7" or N[2] == "7":
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
print('Yes' if "7" in N else 'No')

Solution (Python):
n=list(input())

if "7" in n:
    print("Yes")
else:
    print("No")

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

Ans="No"
for i in range(len(N)):
    if N[i]=="7":
        Ans="Yes"

print(Ans)

Solution (Python):




def main():
    N = input()

    if '7' in N:
        print('Yes')
    else:
        print('No')




if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())

F = str(N)

if F.count("7") > 0:
	print('Yes')
else:
	print('No')

Solution (Python):
N = input()
ans = 'No'
for s in N:
    if s == '7':
        ans = 'Yes'
print(ans)

Solution (Python):
s = input()
print("Yes" if '7' in s else "No")

Solution (Python):
n = input()
b = False
for i in range(3):
    if n[i] == '7':
        b = True
        break
if b:
    print('Yes')
else:
    print('No')

Solution (Python):



N = input()

ans = "No"

for n in range(3):
  if N[n - 1] == "7":
    ans = "Yes"

print(ans)

Solution (Python):
n = input()

if int(n[0]) == 7 or int(n[1]) == 7 or int(n[2]) == 7:
    print('Yes')
else:
    print('No')