#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <deque>
// #include <chrono>
#include <numeric>

using namespace std;
// using namespace std::chrono;

typedef long long int lo;
#define fast ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(0);
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define inf (lo)1e9
#define N (lo)1e5 * 5
#define all(x) (x).begin(), (x).end()
#define ii pair<lo,lo>
#define iii pair<lo, pair<lo,lo> >
#define si pair<string,lo>
#define vi vector <lo> 
#define vii vector <ii> 

void solve(){
    string s;
    cin >> s;
    for(lo i = 0 ; i < s.size() ; i++){
        if(s[i] == '7'){
            cout << "Yes\n";
            return;
        }
    }
    cout << "No\n";
    return;
}
    
int main() {

    #ifndef ONLINE_JUDGE
        // freopen("soru.gir", "r", stdin);
        // freopen("soru.cik", "w", stdout);
    #endif
    
    fast
    
    // auto start = high_resolution_clock::now();

    lo p = 0;

    if(p){
        lo t;
        cin >> t;
        while(t--)
            solve();
    }
    else{
        solve();
    }

    // auto stop = high_resolution_clock::now();
    // auto duration = duration_cast<microseconds>(stop - start);
    
    // #ifndef ONLINE_JUDGE
    //     cout << "Elapsed time is " << duration.count() << " microseconds." << endl;
    // #endif
    
    return 0;
}