#include <bits/stdc++.h>
 
typedef long long ll;
using namespace std;
const int MOD = 1e9+7;
ll cache[123456];
ll calc(int cnt[], int n) {
	if(n==0) {
		return 0;
	}
	if(n==1) {
		return cnt[n];
	}
	
	if(cache[n]!=-1) {
		return cache[n];
	}
	// if we select nth element, then we cant get previous(n-1) result, 
	// we need to get it from prevoious of the previous(n-2) result
	// because previous(n-1) was removed according to game rules
	ll point = 1ll*n*cnt[n];
	cache[n] = max(calc(cnt, n-1), calc(cnt, n-2) + point);
	return cache[n];
}
int main() {
	int n;
	cin>>n;
	while(n) {
		int a = n%10;
		if(a==7) {
			cout <<"Yes";
			return 0;
		}
		n/=10;
	}
	cout <<"No";
	return 0;
}