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

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

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
S = list(input())
if '7' in S:
    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):

from decimal import *
from itertools import permutations, combinations,combinations_with_replacement,product
import math


N = input()



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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

























def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007




def main():
	N = inputInt()
	s = str(N)

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

	








class Graph(object):
    """
    隣接リストによる有向グラフ
    """

    def __init__(self):
        self.graph = defaultdict(list)

    def __len__(self):
        return len(self.graph)

    def add_edge(self, src, dst, weight=1):
        self.graph[src].append((dst, weight))

    def get_nodes(self):
        return self.graph.keys()


class Dijkstra(object):
    """
    ダイクストラ法（二分ヒープ）による最短経路探索
    計算量: O((E+V)logV)
    """

    def __init__(self, graph, start):
        self.g = graph.graph

        
        
        self.dist = defaultdict(lambda: float('inf'))
        self.dist[start] = 0

        
        self.prev = defaultdict(lambda: None)

        
        self.Q = []
        heappush(self.Q, (self.dist[start], start))

        while self.Q:
            
            dist_u, u = heappop(self.Q)
            if self.dist[u] < dist_u:
                continue
            for v, weight in self.g[u]:
                alt = dist_u + weight
                if self.dist[v] > alt:
                    self.dist[v] = alt
                    self.prev[v] = u
                    heappush(self.Q, (alt, v))

    def shortest_distance(self, goal):
        """
        startノードからgoalノードまでの最短距離
        """
        return self.dist[goal]

    def shortest_path(self, goal):
        """
        startノードからgoalノードまでの最短経路
        """
        path = []
        node = goal
        while node is not None:
            path.append(node)
            node = self.prev[node]
        return path[::-1]

def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

    return f(int(math.sqrt(n) * (1 + 1e-10)))



def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res


def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y



def H(n, r, mod=10**9+7):
	
	
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        
        
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

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

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

Solution (Python):
N = input()

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

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

Solution (Python):
import sys
import itertools
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N=input()

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

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

Solution (Python):
n = input()
r = 'No'
for c in n:
	if int(c) == 7:
		r = 'Yes'
		break
print(r)

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



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

print(A)

"""

a = int(input())

if a//100 == 7 or  (a//10)%10 == 7 or a%10 == 7:
	print("Yes")
else:
	print ("No")

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):
n = input()
ans = 'No'

for i in range(len(n)):
    if n[i] == '7':
        ans = 'Yes'
        break
    
print(ans)

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

Solution (Python):
N = int(input())
ans = 0
if N % 10 == 7:
    ans = 1

N //= 10
if N % 10 == 7:
    ans = 1

N //= 10
if N % 10 == 7:
    ans = 1

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

Solution (Python):
s = list(input())
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 = 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
sys.setrecursionlimit(10 ** 7)

n = input().strip()

def cond():
    return '7' in n

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

Solution (Python):
num = input()
  
if '7' in num:
    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()

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

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

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

Solution (Python):
N = int(input())
while(N > 0):
    if N % 10 == 7:
        print("Yes")
        exit(0)
    else:
        N = N // 10
print("No")

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

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

Solution (Python):
n = input()

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

Solution (Python):
n = input()

for x in n:
    if x=='7':
        print('Yes')
        exit()
print('No')

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

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

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

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

Solution (Python):



def solve(*args: str) -> str:
    n = args[0]

    return 'Yes' if 0 < n.count('7') else 'No'


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

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

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

print("No")

Solution (Python):
import sys

input = sys.stdin.readline

sys.setrecursionlimit(10 ** 8)


def main():
    N = input()
    if N.count("7") >= 1:
        print("Yes")
    else:
        print("No")








if __name__ == '__main__':
    main()

Solution (Python):
if 7 in list(map(int,list(input()))):
    print('Yes')
else:
    print('No')

Solution (Python):
usr = str(input())
flag = False


for n in range(3):
    if usr[n] == "7":
        flag = True

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

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):
import sys


def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, 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 SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'


p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

N = input()

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

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

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

print("No")

Solution (Python):

N=input()

flg=False

for i in range(3):
    if N[i]=="7":
        flg=True

if flg:
    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 = input()

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

Solution (Python):
n = ''.join(input())

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

Solution (Python):

def main():
    n = input()
    for i in range(3):
         if n[i]=='7':
            print('Yes')
            return
    print('No')
           
            
if __name__ == "__main__":
    main()

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):
N = input()

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

Solution (Python):
s = input()

print("Yes" if s[0] == "7" or s[1] == "7" or s[2] == "7" else "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 = True
for i in range(3):
  if n[i] == '7':
    ans = False
if ans:
  print('No')
else:
  print('Yes')

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

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()
for i in range(3):
  if n[i]=='7':
    print('Yes')
    exit()
print('No')

Solution (Python):
import math
import copy
import sys
import fractions


import decimal
import heapq
import collections
import itertools
import bisect



sys.setrecursionlimit(100001)







def getInputIntList():
    outputDataList = []
    inputData = input().split()
    outputDataList = [int(n) for n in inputData]

    return outputDataList


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList




n = list(input())

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

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

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

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

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

if __name__ == "__main__":
    main()

Solution (Python):
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def resolve():
    N = sr()
    for i in range(len(N)):
        if N[i] == '7':
            print('Yes')
            return
    print('No')
    return
resolve()

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

    print('No')

if __name__ == '__main__':
    main()

Solution (Python):
import collections
import math
import operator as op
from functools import reduce
from collections import Counter
import numpy as np
import math
import bisect
import heapq


MOD = 1000000007


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


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


def get_inputs(cast_func=None):
    if cast_func is None:
        return input().split()
    else:
        return list(map(cast_func, input().split()))


def get_input(cast_func=None):
    if cast_func is None:
        return input()
    else:
        return cast_func(input())


def is_prime(n):
    if n == 1:
        return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return False
    return True


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




if __name__ == '__main__':
    main()

Solution (Python):
A=input()
flag=False
for i in A:
    if i=="7":
        flag=True
    else:
        falg=flag
if flag:
    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):
def a (n) :
    while n != 0 :
        if n%10 == 7 :
            print("Yes")
            return
        n //= 10 
    print("No")
    return 

if __name__ == "__main__" :
    n = int(input())
    a(n)

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

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

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

Solution (Python):
import sys







def main():
    N = input()

    ans = 'No'
    for s in N:
        if int(s) == 7:
            ans = "Yes"

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
A = input()

ans = "No"
for i in list(A):
    if i == "7":
        ans = "Yes"

print(ans)

Solution (Python):


import sys,math

def ii(): return int(input())
def mii(): return map(int,input().split())
def lmii(): return list(mii())

def decimalToBinary(n):  
    return bin(n).replace("0b", "")

def main():
    n=input()
    if n.count("7")>=1:
        print("Yes")
    else:
        print("No")
    
        
    
            

        
if __name__=="__main__":
    main()

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

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

Solution (Python):



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


if __name__ == '__main__':
    main()

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

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    
    return divisors

def ValueToBits(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res

def BitsToValue(arr):
    n = len(arr)
    ans = 0
    for i in range(n):
        ans+= arr[i] * 2**i
    return ans

def ValueToArray10(x, digit):
    ans = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        ans[digit-i-1] = now%10
        now = now //10
    return ans
'''
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p = 2
N = 10 ** 6 + 2
fact = [1, 1]  
factinv = [1, 1]  
inv = [0, 1]  

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

'''









s = input()

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

Solution (Python):
def resolve():
    '''
    code here
    '''
    N = input()

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


if __name__ == "__main__":
    resolve()

Solution (Python):
import sys

num = sys.stdin.readline().strip()
if "7" in num:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
s = input()

if '7' in s:
    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):
print('YNeos'['7' not in input()::2])

Solution (Python):
if __name__ == "__main__":
    n = input()

    for nn in n:
        if nn == '7':
            print('Yes')
            exit()

    print('No')

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

Solution (Python):

''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
   /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/input.txt"
exit $?
'''
import sys


def _s(): return sys.stdin.readline().strip()


def main():
    if "7" in _s():
        ans = "Yes"
    else:
        ans = "No"
    return ans


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

Solution (Python):
a = input()


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

Solution (Python):
import sys
N=input()

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

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


main()

Solution (Python):
S = input()


if '7' in S:
    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):
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):

import sys

YES = "Yes"  
NO = "No"  


def solve(N: int):
    if '7' in [c for c in str(N)]:
        print(YES)
    else:
        print(NO)
    return



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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import math
import sys


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

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

Solution (Python):


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

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

MOD = 1000000007

def smax(a,b):
    if a>b:
        return a
    else:
        return b

def smin(a,b):
    if a<b:
        return a
    else:
        return b

def main():
    N = int(readline())
    N=str(N)
    flag=False
    for i in range(3):
        if N[i]=="7":
            flag=True
    if flag:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N = sr()
bl = False
for i in range(3):
    if N[i] == '7':
        bl = True
print('Yes' if bl else 'No')

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

Solution (Python):
n = list(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):
import sys
input = sys.stdin.buffer.readline

N = int(input())

if N % 10 == 7:
    print("Yes")
    exit()
N //= 10

if N % 10 == 7:
    print("Yes")
    exit()
N //= 10

if N % 10 == 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):
N=input()

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

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

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

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

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

if '7' in n:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

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):
import sys
n = str(input())
for i in range(3):
     if n[i] == '7':
          print('Yes')
          sys.exit()
print('No')

Solution (Python):
N = input()

def check():
    for s in N:
        if s == '7':
            return True
    return False

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

Solution (Python):
s=input()
ans=False
for i in range(3):
    if(s[i]=='7'):
        ans=True
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=list(input())
print("Yes" if "7" in n else "No")

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):


from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


INF=1001001001
__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


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

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x



if __name__ == '__main__':
    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()

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 N.count("7") > 0:
  print("Yes")
else:
  print("No")

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

for i in str(n):
    if i == '7':
        print('Yes')
        exit()
print('No')

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

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

N = str(N)
if N.find('7') != -1:
    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 N:
    if i == "7":
        ans = "Yes"

print(ans)

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

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

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

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

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