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

typedef long long ll;
#define fori(n) for(int i=0;i<n;i++)
#define pb push_back


ll power(ll base,ll e)
{
    ll answer=1;
    //ll e=1000000005;
    while(e)
    {
        if(e%2==1)
        {
            answer*=base;
        }
        base*=base;
       // base%=mod;
        e/=2;
       // answer%=mod;
    }
    return answer;
}


void sieveprimes(ll n)
{
    bool prime[n+1];
    memset(prime,true,sizeof(prime));

    for(ll i=2;i*i<=n;i++)
    {
        if(prime[i]==true)
        {
            for(ll j=i*i;j<=n;j+=i)
            {
                prime[j]=false;
            }

        }

    }

    /*for (int p=2; p<=n; p++)
       if (prime[p])
          cout << p << " ";*/
    /*for(ll i=2;i<=n;i++)
    {
        if(prime[i])    ans.insert(i*i);
    }*/
}


int main()
{

   string s;
   cin>>s;
   int flag=0;
   for(int i=0;i<s.length();i++)
   {
       if(s[i]=='7')
       {
           flag  = 1;
           break;
       }

   }
   if(flag==1) cout<<"Yes"<<endl;
   else cout<<"No"<<endl;

}
