/*
Date : X/04/2020
Time : 
author - @wayToHell (Avinash Prasad)
Contest Name : Codeforce Round #
Problem id : A
Problem name : Piles With Stones
Problem Link : https://codeforces.com/contest/1013/problem/A
FROM DUST I HAVE COME, DUST I WILL BE....
                           -Anonymous
*/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#include <bits/stdc++.h>
using namespace std ;
#define INF 18446744073709551610
#define MOD 1000000007
#define loop(i,n) for( int i=0;i<n;i++)
#define loopab(i,a,b) for(int i=a;i<=b;i++) 
#define loopr(i,b,a) for(int i=b;i>=a;i--)
#define P first
#define Q second
#define FILL(x,a) memset ( x , a ,sizeof x)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long long int lli;
typedef vector<int> vi;
typedef pair <int,int> pii;
typedef vector < pii > vii;
typedef vector < vii > viii;
int main()
{
	speed;
	int n;
	cin >> n;
	bool flag = false;
	while(n)
	{
		if(n%10==7)
		{
			flag = true;
			break;
		}
		n/=10;
	}
if(flag)
	cout <<  "Yes"<< endl;
else
	cout << "No" << endl
	return 0;
}