#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXD=105;
const int MAXA=1005;
const int MAXB=10005;
const int MAXC=1000005;
const int Maxx=0x7fffffff/2;
const int Minn=-0x7fffffff/2;
const int Maxn=0x3f3f3f3f;
const int Minm=-0x3f3f3f3f;
inline void read(int &oi){
	char ch;int f=1,res=0;
	while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
	ch=='-'?f=-1:res=ch-'0';
	while(ch=getchar(),ch>='0'&&ch<='9')res=(res<<1)+(res<<3)+ch-'0';
	oi=res*f;
}
int maxxx(int x,int y){return x>y?x:y;}
int minnn(int x,int y){return x<y?x:y;}
int n;
int main(){
	read(n);
	while(n){
		if(n%10==7){
			puts("Yes");
			return 0;
		}
		n/=10;
	}
	puts("No");
	return 0;
}