//
// Created by Debajyoti Dasgupta on 11-04-2020.
//

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fr(i, n) for(int i=0;i<n;i++)
#define frr(i, n) for(int i=n;i>=0;i--)
#define fra(i, a, n) for(int i=a;i<n;i++)
#define frra(i, a, n) for(int i=a;i>=n;i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define ff first
#define ss second
#define endl '\n'

typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef set<int> si;
typedef unordered_map<int, int> uii;
typedef unordered_set<int> usi;
typedef vector<int> vi;

const int mod = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int inf = LONG_LONG_MAX;

using point = pair<pii, pii>;

void solve() {
    //CODE BEGIN
    int n;
    cin >> n;
    if (n % 10 == 7) {
        cout << "Yes\n";
        return;
    }
    n /= 10;
    if (n % 10 == 7) {
        cout << "Yes\n";
        return;
    }
    n /= 10;
    if (n % 10 == 7) {
        cout << "Yes\n";
        return;
    }
    cout << "No\n";

}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
//    cin >> t;
    for (int i = 0; i < t; ++i) {
//        cout << "Case #" << i + 1 << ": " << endl;
        solve();
    }
    return 0;
}