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):
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 = 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 s in N:
    if s == "7":
        ans = "Yes"
        break
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):
import sys
input = sys.stdin.readline

def linput():
    return [int(x) for x in input().split()]

n = input().rstrip()

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

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

Solution (Python):




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


if __name__ == "__main__":
    main()

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

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


def main():
    N = input()[:-1]
    if "7" in N:
        print("Yes")
    else:
        print("No")
        


if __name__ == '__main__':
    main()

Solution (Python):
N = list(input())
print("YNeos"[not "7" in N::2])

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 = list(input())
    if "7" in n:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)
    

    
if __name__ == '__main__':
    main()

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

for i in range(3):
    if N[i] == '7':
        print('Yes')
        exit()
print('No')

Solution (Python):
n = input()
for i in range(0, len(n)):
    if n[i] == '7':
        print("Yes")
        exit()
print("No")

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

Solution (Python):
def _in():
    return [int(x) for x in input().split(' ')]


if __name__ == '__main__':
    
    s=input()
    print("Yes" if "7" in s else "No")

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

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

Solution (Python):
if '7' in input():
  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):
n = list(input())
if '7' in n:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

n = ns()

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

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

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

Solution (Python):
import sys

stdin = sys.stdin

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

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

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

Solution (Python):
s = input()
if '7' in s:
    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):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

N = list(str(int(input())))

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

Solution (Python):
def main():

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

if __name__ == '__main__':
    main()

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

Solution (Python):
n = input()

if n.count('7'):
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

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

Solution (Python):

a = input()
ret = "No"
if a.count("7") > 0:
    ret  ="Yes"
print(ret)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    def main():
        n=str(input())
        for i in n:
            if int(i)==7:
                return 'Yes'
        return 'No'
    print(main())

resolve()

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

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

Solution (Python):
import sys
input=sys.stdin.readline
n=int(input())
n=str(n)
if n[0]=='7' or n[1]=='7' or n[2]=='7':
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
cad = input()
if cad.find('7') != -1:
    print('Yes')
else:
    print('No')

Solution (Python):
x = input()

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

Solution (Python):
t = 1
for _ in range(t):
    n=(input())
    if('7' in n):
        print("Yes")
    else:
        print("No")

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

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

Solution (Python):
s = input()

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

Solution (Python):
s=input()
if '7' in s: 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):
if '7' in input():
  print('Yes')
else:
  print('No')

Solution (Python):
S = input().strip()
print('Yes' if '7' in S else 'No')

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

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

Solution (Python):

N = input()

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

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

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

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

Solution (Python):
N = input()
cond = 0
for i in range(len(N)):
	if N[i] == '7':
		cond = 1
		break

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

Solution (Python):
a=input()
if '7' in a:
  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):
S=input()
if "7" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
import collections, math

local = False
if local:
    file = open("input.txt", "r")

def inp():
    if local:
        return file.readline().rstrip()
    else:
        return input().rstrip()

def ints():
    return [int(_) for _ in inp().split()]


n = int(inp())

if "7" in str(n):
    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):
s = input()

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

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

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

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

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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = list(input())

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

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

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

Solution (Python):
N = input()

ans = 'No'

for i in N:
    if i == '7':
        ans = 'Yes'
print(ans)

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

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

Solution (Python):
import sys
n=list(input())
for i in range(3):
  if n[i]=='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):
ls = list(input())

if '7' in ls:
    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):
s = input()
if '7' in s:
  print("Yes")
else:
  print("No")

Solution (Python):
a = input()
for aa in a:
    if aa == '7':
        print('Yes')
        break
else:
    print('No')

Solution (Python):
n = input()
res = False
for char in n:
    if char == "7":
        res = True
print("Yes" if res else "No")

Solution (Python):
a = input()

for ai in a:
    if ai == '7':
        print('Yes')
        break
else:
    print('No')

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

Solution (Python):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

Solution (Python):
N = input()

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

Solution (Python):
s = input()

ans = "No"
for i in s:
  if i == "7":
    ans = "Yes"
    
print(ans)

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

s = str(n)
s = list(s)
for i in range(len(s)):
    if s[i] == "7":
        print("Yes")
        exit()

print("No")

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

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

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

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

Solution (Python):
n=list(str(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()

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

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

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

Solution (Python):
import numpy as np
import math
import statistics
import collections

def solve():
    n = input()
    if n[0] == "7" or n[1] == "7" or n[2] == "7":
        print("Yes")
    else:
        print("No")
    return 0

if __name__ == "__main__":
    solve()

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

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

Solution (Python):
n = input()

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

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

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

Solution (Python):
from collections import *

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
if f:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





n=list(ss())

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

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

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

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

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

Solution (Python):
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
INF = 10**10+5
MOD =10**9+7


n = input()
for i in range(len(n)):
    if n[i] == "7":
        print("Yes")
        sys.exit()
print("No")

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

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

Solution (Python):

import sys
input = sys.stdin.readline

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

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

Solution (Python):

N = input()
for i in range(3):
    if N[i] == '7':
        print("Yes")
        exit()
print("No")

Solution (Python):

n = int(input())

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

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

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

Solution (Python):
MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

def main():
    n = input()
    if '7' in n:
        print('Yes')
    else:
        print('No')
if __name__ =='__main__':
    main()

Solution (Python):

import sys

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

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

print("No")

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

Solution (Python):
n = input()
for i in n:
    if i == "7":
        print("Yes")
        exit()
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):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

n = input()
for ni in n:
  if ni == "7":
    print("Yes")
    exit()
print("No")

Solution (Python):
n = int(input())
a = False
for i in str(n):
    if i=='7':
        a = True

print('Yes' if a else 'No')

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

Solution (Python):
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    s = input()
    for i in s:
        if i == '7':
            print(yes)
            exit()
    print(no)


main()

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

if __name__ == '__main__':
    main()

Solution (Python):
N = list(str(input()))
flag = 0
for i in range(3):
    if N[i] == '7':
        flag = 1

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

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


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
from collections import defaultdict, deque
import sys
import heapq
import bisect
import math
import itertools
import string
import queue
import copy
import time

from fractions import gcd

sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7

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

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

n = inp()
s = str(n)
for i in range(3):
    if s[i] == '7':
        print('Yes')
        exit()
print('No')

Solution (Python):
s = input()

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

Solution (Python):
N = input().strip()

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

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()

N = i_s()

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 N[0]=='7' or N[1]=='7' or N[2]=='7':
    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):
N = input()

if '7' in N:
    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 n[0] == "7" or n[1] == "7" or n[2] == "7":
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
N=input()
for i in range(3):
    if N[i]=="7":
        print("Yes")
        exit()
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())
if  "7" in str(n):
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

for c in S:
  if c == "7":
    print("Yes")
    exit()

print("No")

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

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

Solution (Python):
s = input()

for a in s:
    if a == '7':
        print("Yes")
        exit(0)
print("No")

Solution (Python):
n = input()

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

Solution (Python):
N = input()

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

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

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

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






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

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

Solution (Python):


import sys
from itertools import accumulate

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

S = input()

if S.count('7'):
    Yes()
else:
    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()

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

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

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

Solution (Python):
s = input()
if '7' in s:
    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):
s = input()
if '7' in s:
  print("Yes")
else:
  print("No")

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

Solution (Python):
print("YNeos"[input().count("7")<1::2])

Solution (Python):
N = input()

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

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

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

N = input()

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

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

Solution (Python):
import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(10**7)

N = input()

if "7" in N:
    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()
if "7" in n:
    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):
s = input()

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

Solution (Python):

def main():
    s = input()
    if "7" in s:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

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

Solution (Python):
def main():
    n=input()
    if "7" in n:
        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=input()
print('Yes' if '7' in n else 'No')

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

Solution (Python):

"""
Created on Sun Apr 12 20:58:47 2020

@author: Kanaru Sato
"""

n = list(input())

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

Solution (Python):
def solve():
    N = input()
    for i in N:
        if i == '7':
            print('Yes')
            return
    
    print('No')
if __name__ == '__main__':
    solve()

Solution (Python):
S = input()
s = set(S)
if "7" in s:
    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):
import string
def num():
    return int(input())
def nums():
    return list(map(int,input().split()))


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

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

Solution (Python):
s = input()

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

Solution (Python):
import sys

n = input()

for i in n:
    if i == '7':
        print('Yes')
        sys.exit()

print('No')

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
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 li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]




S = input()

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

Solution (Python):
import sys

X = sys.stdin.readline().rstrip()

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

Solution (Python):
import sys
input = sys.stdin.readline
N = list(input())[: -1]
if "7" in N: print("Yes")
else: print("No")

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

Solution (Python):
N = input().rstrip()

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    n=input()
    if '7' in n:print("Yes") 
    else: print("No")

if __name__=='__main__':
    main()

Solution (Python):

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

Solution (Python):
n = input()

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

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

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

Solution (Python):
n = input()
flag = False
for c in n:
    if c == "7":
        flag = True

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

Solution (Python):
import sys, re, os
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
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = input()

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

Solution (Python):
import math

def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

n = Next()

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

Solution (Python):
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left 
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

N = int(input())
sN = str(N)

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

Solution (Python):
print('Yes' if '7' in input() 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):
def main():
    n=int(input())
    ans='No'
    for i in list(str(n)):
        if i=='7':
            ans='Yes'
    print(ans)

if __name__=='__main__':
    main()

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

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

Solution (Python):
n = input()
l = list(n)
if "7" in l:
    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):

MOD = 10 ** 9 + 7
INFI = 10**10

import math

import itertools
import heapq


import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default




def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)


def main():
    n=list(input())
    ans="No"
    for i in n:
        if i=="7":
            ans="Yes"
    print(ans)



if __name__ == "__main__":

    main()