#include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

// 最小公倍数を求める
int euqlid (int a, int b){
  int temp;
  temp = a % b;
  if(temp == 0)return b;
  return euqlid(b,temp);
}
ll conbination(ll a,ll b){
  ll u = 1;
  ll d = 1;
  while(b != 0){
    u *= a;
    d *= b;
    a--;
    b--;
  }
  return u / d;
}

int main(){
 int n;
 string ans = "No";
 cin >> n;
 for(int i = 2;i > -1;i--){
   int m = n / pow(10,i);
   int temp = pow(10,i);
   n = n % temp;
   if(m == 7)ans = "Yes";
 }
 cout << ans << endl;
}
