#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define print(A,n) for(ll i=0;i<n;++i)cout<<A[i]<<' ';cout<<endl;
#define take(A,n) for(ll i=0;i<n;++i)cin>>A[i];
//    for(auto& it : m)
void fastio(){ios_base::sync_with_stdio(false);cin.tie(NULL);}
//  priority_queue<ll int> pq;
//  priority_queue <ll int, vector<ll int>, greater<ll int> > pq;
//  vector<ll int> v;
//  vector< pair<ll int,ll int> > v;
//  set<ll int>::iterator it=s.begin();
//  unordered_map<  pair<ll int,ll int>, ll int> mp;
 
 
const int ALPHABET_SIZE = 26; 
  
// trie node 


int main() 
{ 
ll int T;T=1;
while(T--)
{ll int N;cin>>N;
  while(N>0)
  {
    ll int k=N%10;
    if(k==7)
    {
      cout<<"Yes"<<endl;
      return 0;
    }
    N/=10;
  }
  cout<<"No"<<endl;
}


       
    return 0; 
} 
