/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author Joy
 */

#ifndef JHELPER_EXAMPLE_PROJECT_DEFINITION_HPP
#define JHELPER_EXAMPLE_PROJECT_DEFINITION_HPP

#include <bits/stdc++.h>

#define REP(i, N) for (ll i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF ll(1e9)
#define INFL ll(1e18)
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int ctoi(char c) {return c - '0';}

#endif //JHELPER_EXAMPLE_PROJECT_DEFINITION_HPP

#ifndef JHELPER_EXAMPLE_PROJECT_UNIONFIND_HPP
#define JHELPER_EXAMPLE_PROJECT_UNIONFIND_HPP



struct UnionFind {
    vector<ll> data;
    UnionFind(ll size) : data(size, -1) {}

    ll root(ll x) {
        if (data[x] < 0)
            return x;
        else
            return data[x] = root(data[x]);
    }

    ll size(ll x) { return -data[root(x)]; }

    bool isConnect(ll x, ll y) { return root(x) == root(y); }

    bool connect(ll x, ll y) {
        x = root(x);
        y = root(y);

        if (x == y)
            return false;

        if (data[x] > data[y]) {
            x ^= y;
            y ^= x;
            x ^= y;
        }

        data[x] = data[x] + data[y]; // membersize++
        data[y] = x;
        return true;
    }
};


#endif //JHELPER_EXAMPLE_PROJECT_UNIONFIND_HPP


class ALucky7 {
public:
	void solve(std::istream& in, std::ostream& out) {
	    UnionFind U(5);
	    string N; in >> N;
	    string ans = "No";
	    REP(i, N.size()) {
	        if (N[i] == '7') ans = "Yes";
	    }
	    out << ans << '\n';
	}
};


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

	ALucky7 solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}
