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

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

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

Solution (Python):
n = input()

if len(n) == len(n.replace('7','')):
  print('No')
else:
  print('Yes')

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

Solution (Python):
import sys,math,copy,queue,itertools,bisect
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))

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

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

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

if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):


line = input()

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

Solution (Python):



from math import *
from copy import *
from heapq import *
from string import *				
from random import *				
from bisect import *				
from sys import stdin				
from sys import maxsize
from operator import *				
from itertools import *
from collections import Counter		
from collections import defaultdict 

'''

'''

def f(flag):
	if(flag):
		return 'Yes'
	else:
		return 'No'

def solve(l):
	l = list(str(l))
	ff = 0
	if('7' in l):
		ff = 1
	return (f(ff))

N = int(stdin.readline())
print(solve(N))

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().rstrip()
if '7' in n:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
N = input()

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

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

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

Solution (Python):
mod = 10**9 + 7
mod2 = 2**61 + 1
int1 = lambda x: int(x) - 1
from collections import deque
import heapq
import time
from bisect import bisect_left, insort_left, bisect_right
import sys
import random
import itertools



def input():
    return sys.stdin.readline().strip("\n").strip(" ")


_NUMINT_ALL = list(range(10))
_START_TIME = time.time()
INDEX_KETA = 10**12
INF = 9223372036854775807  

def main():
    ans = solve()

    if ans is True or ans is False:
        YesNo(ans)
    elif ans is None:
        return

    elif isinstance(ans, tuple):
        split_print_space(ans)
    else:
        print(ans)


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






def kiriage_warizan(a, b):
    return -(-a // b)


def iip(listed=False):  
    d = input().rstrip("\n").split()
    try:
        ret = [int(i) for i in d]
    except:
        ret = [int(i) if i in _NUMINT_ALL else i for i in d]
        if len(ret) == 1 and listed is False:
            return ret[0]

    if len(ret) == 1 and not listed:
        return ret[0]
    return ret


def iipt(l, listed=True):  
    if isinstance(l, list):
        l = l[0]  
    assert isinstance(l, int)
    ret = []
    for i in range(l):
        ret.append(iip(listed=listed))
    return ret


def saidai_kouyakusuu(A):  
    l = len(A)
    while True:
        m = min(A)
        mx = max(A)
        if m == mx:
            return m

        for i in range(l):
            if A[i] % m == 0:
                A[i] = m
            else:
                A[i] %= m


def flatten(l):
    return list(itertools.chain.from_iterable(l))


def index_sorted(sorted_list, target):
    idx = bisect_left(sorted_list, target)
    if idx != len(sorted_list) and sorted_list[idx] == target:
        return idx
    else:
        return False


def time_debug_10percent():
    a = random.randint(0, 9)
    if a == 9:
        sys.exit()


def time_debug(t):
    time.sleep(_START_TIME + t - time.time())
    sys.exit()


def make_graph_edge_flat(N):  
    ret = []
    for i in range(N - 1):
        a, b, c = iip()
        a -= 1
        b -= 1
        ret[a].append((b, c))
        ret[b].append((a, c))
    return ret


def sort_tuples(l, index):  
    if isinstance(l, list):
        l.sort(key=lambda x:x[index])
        return l
    else:
        l = list(l)
        return sorted(l, key=lambda x:x[index])


def count_elements(l):  
    d = {}
    for i in l:
        if i in d:
            d[i] += 1
        else:
            d[i] = 1
    return d


def safeget(l, index, default="exception"):  
    if index >= len(l):  
        if default == "exception":
            raise Exception("".join(["safegetに不正な値 ", index, "が渡されました。配列の長さは", len(l), "です"]))
        else:
            return default
    elif index < 0:
        if default == "exception":
            raise Exception("".join(["safegetに不正な値 ", index, "が渡されました。負の値は許可されていません"]))
        else:
            return default
    else:
        return l[index]


def sortstr(s):  
    return "".join(sorted(s))


def iip_ord(startcode="a"):  
    if isinstance(startcode, str):
        startcode = ord(startcode)
    return [ord(i) - startcode for i in input()]


def YesNo(s):  
    if s:
        print("Yes")
    else:
        print("No")


def fprint(s):  
    if isinstance(s, int):
        print(s)
        return
    keta = max([len(str(i)) for i in itertools.chain.from_iterable(s)])
    print("--------")
    for i in s:
        print([str(j).rjust(keta) for j in i])
    print("--------")


def bitall(N):  
    ret = []
    for i in range(2**N):
        a = []
        for j in range(N):
            a.append(i % 2)
            i //= 2
        ret.append(a)
    return ret


def split_print_space(s):  
    print(" ".join([str(i) for i in s]))


def split_print_enter(s):  
    print("\n".join([str(i) for i in s]))


def soinsuu_bunkai(n):  
    ret = []
    for i in range(2, int(n**0.5) + 1):
        while n % i == 0:
            n //= i
            ret.append(i)
        if i > n:
            break
    if n != 1:
        ret.append(n)
    return ret


def conbination(n, r, mod, test=False):  
    if n <= 0:
        return 0
    if r == 0:
        return 1
    if r < 0:
        return 0
    if r == 1:
        return n
    ret = 1
    for i in range(n - r + 1, n + 1):
        ret *= i
        ret = ret % mod

    bunbo = 1
    for i in range(1, r + 1):
        bunbo *= i
        bunbo = bunbo % mod

    ret = (ret * inv(bunbo, mod)) % mod
    if test:
        
        pass
    return ret


def inv(n, mod):  
    return power(n, mod - 2)


def power(n, p, mod_=mod):  
    if p == 0:
        return 1
    if p % 2 == 0:
        return (power(n, p // 2, mod_)**2) % mod_
    if p % 2 == 1:
        return (n * power(n, p - 1, mod_)) % mod_


def nibutan_func(func, target, left, right, side="left", seido=1):  
    l = left
    r = right
    if seido == 1:
        x = (l + r) // 2
    else:
        x = (l + r) / 2
    while r - l > seido:
        
        if seido == 1:
            x = (l + r) // 2
        else:
            x = (l + r) / 2
        if func(x) == target:
            if side == "left":
                r = x
            else:
                l = x


        elif func(x) > target:
            r = x
        else:
            
            l = x

    
    if side == "left" and func(r) == target:
        return r
    elif side != "left" and func(l) == target:
        return l
    elif side == "left":
        return l
    else:
        return r


def nibutan_list(list_, target, side="left"):  
    if not isinstance(list_, list):
        list_ = list(list_)

    l = 0
    r = len(list_)
    x = (l + r) // 2
    while r - l > 1:
        x = (l + r) // 2
        if list_[x] == target:
            return x
        elif list_[x] > target:
            r = x
        else:
            l = x

    if side == "left" or list_[x] == target:
        return l
    else:
        return r


class UfTree():
    def __init__(self, maxnum):
        self.parent = list(range(maxnum))
        self._size = [1] * maxnum
        self.rank = [0] * maxnum

    def size(self, a):
        return self._size[self.root(a)]

    def root(self, a):
        rank = 0
        cur = a
        while True:
            if self.parent[cur] == cur:
                
                
                return cur
            else:
                self.parent[cur] = self.parent[self.parent[cur]]
                cur = self.parent[cur]
                rank += 1

    def unite(self, a, b):
        ra = self.root(a)
        rb = self.root(b)
        if ra == rb:
            return self

        self._size[ra] += self._size[rb]
        self.parent[rb] = ra
        return self


if __name__ == "__main__":
    main()

Solution (Python):
N = input()

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

Solution (Python):


N = int(input())

str_N = list(str(N))

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

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

Solution (Python):
N = input()
true_flag = False
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):
def main():
    N = input()
    for n in N:
        if n == "7":
            return "Yes"
    return "No"


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

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

Solution (Python):
import sys
from math import ceil, floor
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

def main():
    n = int(input())
    strn = str(n)
    for i in range(len(strn)):
        if strn[i] == '7':
            print("Yes")
            return
    print("No")
    return

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
def f(N):
    A=str(N)
    if "7" in A:
        return "Yes"
    else:
        return "No"
N=int(input())
print(f(N))

Solution (Python):
import math
import fractions
import collections
import itertools
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):
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

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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):
import sys
from io import StringIO
import unittest

def resolve():
    n = input()

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


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

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):
N = [x for x in input()]
if '7' in N:
    print('Yes')
else:
    print('No')

Solution (Python):
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
import numpy as np
from collections import deque, Counter, defaultdict
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush, heapify
from bisect import bisect_left, bisect_right, bisect
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
from functools import reduce
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
def lcm_base(a, b):
    return (a * b) // gcd(a, b)

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


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

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


if __name__ == '__main__':
    main()

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

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

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

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

flag = False
for char in N:
  if char == '7':
    flag = True

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

Solution (Python):
N = input()
print('Yes' if N[0] == '7' or N[1] == '7' or N[2] == '7' else '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()
flag = False
for c in n:
    if c == '7': flag = True
print("Yes" if flag else "No")

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

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

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

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

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

n = ns()

n = list(n)

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

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

    return 0


if __name__ == '__main__':
    main()

Solution (Python):
a = list(map(int, input()))
if 7 in a:
    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):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import Counter
from pprint import pprint

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

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col):
    data.sort(key=lambda x:x[col],reverse=False)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

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()
cnt = N.count('7')
if cnt:
    print('Yes')
else:
    print('No')

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

Solution (Python):


n = list(str(input()))

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

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = input()
    if '7' in N:
        print('Yes')
    else:
        print('No')


main()

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

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

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

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

Solution (Python):
s = input()
a = False
for i in range(3):
  if s[i] == "7":
    a = True
if a:
  print("Yes")
else:
  print("No")

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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


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

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

if '7' in str(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()

ans = 'Yes'

if n.count('7') <= 0:
    ans = 'No'

print(ans)

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

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

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

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

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

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

Solution (Python):
def main():
    N = input()
    ans = False
    for i in range(len(N)):
        if N[i] == '7':
            ans = True
            break

    if ans ==False:
        print("No")
    else:
        print("Yes")

main()

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

import numpy as np
N = (input())

if '7' in N:
    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=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):
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):
import sys
import math
from functools import reduce
from operator import mul
sys.setrecursionlimit(10**6)

def InMap(): return list(map(int, sys.stdin.readline().split(' ')))
def In(): return int(sys.stdin.readline())
def InS(): return sys.stdin.readline()

N = InS()
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())
print('Yes' if '7' in n else 'No')

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

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



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

Solution (Python):
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    N = input().rstrip('\n')
    ok = 0
    for i in range(3):
        if N[i] == "7":
            ok = 1
    if ok:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

Solution (Python):

import sys
import math
import string
import collections
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

sys.setrecursionlimit(10 ** 8)


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

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 '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
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    
    
    
    ss=readline().rstrip()
    for s in ss:
        if s=="7":
            print("Yes")
            return
    print("No")
    

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

Solution (Python):
N = input()

if N.count('7') == 0:
    print('No')
else:
    print('Yes')

Solution (Python):


def main():
    n = int(input())

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
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 LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	n = II()
	ch = False
	for nn in str(n):
		if(nn=='7'):
			ch=True
	if ch:
		print("Yes")
	else:
		print("No")

if __name__ == '__main__':
	main()

Solution (Python):
s = input()

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

Solution (Python):
N = list(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):
S = input()
  
for i in S:
  if i == '7':
    print('Yes')
    exit()
print('No')

Solution (Python):












mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

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

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

if __name__=='__main__':
    main()

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

Solution (Python):
S = input()
ans = "No"
for char in S:
    if char == "7":
        ans="Yes"
        break
print(ans)

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

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

main()

Solution (Python):
N = input()
if "7" in 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 = str(input())

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

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

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):
def resolve():
    N = input()
    return print("Yes" if N.count("7") > 0 else "No" )

if __name__ == "__main__":
    resolve()

Solution (Python):
from sys import stdin

def main():

    input = stdin.readline

    X = input()

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

    
if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
S=input()
for s in S:
  if s=='7':
    print('Yes')
    exit(0)
print('No')

Solution (Python):
from sys import stdin
N = (stdin.readline().rstrip())
if "7" in list(N):
    print("Yes")
else:
    print("No")