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):
def count_section_by_zero(data):
  count = 0
  flg = False
  start = 0
  for i, d in enumerate(data):
    if flg is False and d != 0:
      count += 1
      flg = True
      
    if d == 0:
      flg = False
  return count

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

def input_list_str():
  return list(map(str, input().split()))

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

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

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

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

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


def divide_two(arg):
  c = 0
  while True:
    if c >= 2:
      break
    if arg % 2 != 0:
      break
    arg //= 2
    c += 1
  return c


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def main():
  n = str(input())
  if '7' in n:
    print('Yes')
  else:
    print('No')
  
import math
import fractions
import collections
import itertools
from functools import reduce
main()

Solution (Python):
def main():

    N = input()
    if '7' in N:
        return "Yes"
    return "No"

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

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

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

Solution (Python):
from math import *

n = input()
ha = False
for i in n:
    if i == '7':
        ha = True
        break


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

ans = 'No'
if '7' in str(N):
    ans = 'Yes'

print(ans)

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

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

Solution (Python):
N = input()

num = N.count('7')
if num >= 1:
    print('Yes')
else:
    print('No')

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

Solution (Python):
n = input()

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

Solution (Python):
n = input()

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

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

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

Solution (Python):
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

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



if __name__ == '__main__':
    main()

Solution (Python):
def main():
    S = input()
    cond = '7' in S
    print('Yes' if cond else '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):
import sys

stdin = sys.stdin

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

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

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
setrecursionlimit(1000000)


INF = int(1e10)

def input():
    return stdin.readline()[:-1]

def main():
    from builtins import int, map
    n = input()
    if n[0] == '7' or n[1] == '7' or n[2] == '7':
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: print('Yes' if b else 'No')
YESNO=lambda b: print('YES' if b else 'NO')

def main():
    N=input()
    YesNo('7' in N)

if __name__ == '__main__':
    main()

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

Solution (Python):
N = input()

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

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

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

Solution (Python):
S = input()
ans = 0
for i in range(len(S)):
    if S[i] == "7":
        ans += 1
if ans>=1:
    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):
N = input()
ans = 'Yes' if '7' in N else 'No'
print(ans)

Solution (Python):

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

sys.setrecursionlimit(1000000)
mod = 1000000007

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


if __name__ == "__main__":
    solve()

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

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



n = list(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 "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):
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 = list(input())

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

Solution (Python):

import sys

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

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


import sys
import math
import collections
import itertools
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def lcm(x, y) : return (x * y) // math.gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")

N = input()

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

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

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

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

Solution (Python):
from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)

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

main()

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,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 fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    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):
s = input()

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

Solution (Python):
import sys

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

def main():
    ans = 'Yes' if '7' in n else 'No'
    print(ans)

if __name__ ==  '__main__':
    main()

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

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

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

Solution (Python):
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

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

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  s=S()
  if '7' in s:
    return 'Yes'
  return 'No'


print(main())

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

Solution (Python):
n=input()
for c in n:
  if c=='7':
    print('Yes')
    break
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, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(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()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = True

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

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

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

Solution (Python):
import sys


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


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


if __name__ == "__main__":
    main()

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

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

Solution (Python):


iim = lambda: map(int, input().rstrip().split())

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

if __name__ == "__main__":
    resolve()

Solution (Python):

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

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

import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [input() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [int(input()) for i in range(n)]


class Math():
    @staticmethod
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    @staticmethod
    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    @staticmethod
    def divisor(n):
        res = []
        i = 1
        for i in range(1, int(n ** 0.5) + 1):
            if n % i == 0:
                res.append(i)
                if i != n // i:
                    res.append(n // i)
        return res

    @staticmethod
    def round_up(a, b):
        return -(-a // b)

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


def pop_count(x):
    x = x - ((x >> 1) & 0x5555555555555555)
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
    x = x + (x >> 8)
    x = x + (x >> 16)
    x = x + (x >> 32)
    return x & 0x0000007f


MOD = int(1e09) + 7
INF = int(1e15)


def solve():
    S = Scanner.string()
    for s in S:
        if s == '7':
            print('Yes')
            return
    print('No')


def main():
    
    solve()


if __name__ == "__main__":
    main()

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

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

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    s = S()
    if '7' in s:
        print("Yes")
    else:
        print("No")

main()

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

Solution (Python):


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

Solution (Python):
S=input()
print("YNeos"[not(S.find("7")>=0)::2])

Solution (Python):
"""
じょえチャンネルおもしろいよ～～～
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""

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

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

Solution (Python):
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')
def Z(f):
    if f:
        print('Yay!')
    else:
        print(':(')
def ispow(n):
    if int(n**.5)**2==n:
        return True
    return False

y('7' in input())

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

import numpy as np

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

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




N = sys.stdin.buffer.readline().decode().rstrip()
if '7' in N:
    print('Yes')
else:
    print('No')
'7' in N