#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#define MAXN 2000000
#define int long long
#define INF (1e9 + 7)
#define MANX MAXN
// #pragma GCC optimize(2)

using namespace std;

inline int read()
{
	int x = 0, f = 1; char c = getchar();
	while (c > '9' || c < '0') {if (c == '-') f = -1; c = getchar();}
	while (c >= '0' && c <= '9') {x = x * 10 + (c ^ 48); c = getchar();}
	return f * x;
}

int n, m, a[MAXN]; 

char c[MAXN];

signed main()
{
	cin >> c;
	int len = strlen(c);
	for (int i = 0;	i < len; i++)
		if (c[i] - 48 == 7)
		{
			puts("Yes");
			return 0;
		}
	puts("No");
	return 0;
}