// #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
using namespace std;

typedef long long ll;
typedef pair<ll ,ll> pll;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)

const ll mod = 1000000009;
const ll INF = 1e18;//1*10^18

ll powll(ll a,ll n){
  if(n==0)
  {
    return 1;
  }
  return powll(a,n-1)*a;
}

int ReturnDigit(ll num)
{
  string number=to_string(num);
  return number.length();
}

int main() {
  ll i,j,k,l;
  string n;
  cin >>n; 
  rep(i,3)
  {
    if(n[i]=='7')
    {
      cout<<"Yes"<<endl;
      return 0;
    }
  }
  cout<<"No"  <<endl;
}