stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

	const int maxn=55;

	int a[maxn][maxn];

	int n;

	int main(){

		IOS

		bool ans=1;

		string s;

		cin>>s;

		if(s[0]=='7'||s[1]=='7'||s[2]=='7')

			cout<<"Yes"<<endl;

		else

			cout<<"No"<<endl;

		return 0;

	} 

// Faster C++ solution for the same problem (measured speedup: 5.432292721068383x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

	int n,cnt=0;

	cin>>n;

	while(n)

	{

		if(n%10==7)

		   cnt++;

		n/=10;

	}

	if(cnt==0)

	    cout<<"No"<<endl;

	else

	    cout<<"Yes"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.317605783191396x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



 int main()

 {

 	int n;

 	cin>>n;

 	if(n%10 == 7 || n/10%10 == 7 || n/100 == 7)

 	    cout<<"Yes"<<endl;

 	else cout<<"No"<<endl;

 	

 	return 0;

 }

// Faster C++ solution for the same problem (measured speedup: 5.318704022178654x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	string n; 

	cin>>n;

	if(n[0]=='7'||n[1]=='7'||n[2]=='7')

	cout<<"Yes";

	else

	cout<<"No";



} 


// Faster C++ solution for the same problem (measured speedup: 5.295606863902858x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define forn(i, n) for (int i = 0; i < int(n); ++i)

#define for1(i, n) for (int i = 1; i <= int(n); ++i)

#define ms(a, x) memset(a, x, sizeof(a))

#define F first

#define S second

#define all(x) (x).begin(),(x).end()



using namespace std;

typedef long long ll;

typedef pair<int, int> pii;

const int INF = 0x3f3f3f3f;

mt19937 gen(random_device{}());



int main() {

    ios::sync_with_stdio(false);

    cin.tie(nullptr);

    string st;

    cin>>st;

    if(st.find('7')!=st.npos) cout<<"Yes";

    else cout<<"No";

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.466396426782921x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    for(int i=0;i<3;i++)

    {

        char cc;

        cc=getchar();

        if(cc=='7'){cout<<"Yes"<<endl;return 0;}

    }

    cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.26409909244631x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

int main(){

    int n;

    cin>>n;

    if(n%10==7||n/10%10==7||n/100==7){

        cout<<"Yes";

    }

    else cout<<"No";

}


// Faster C++ solution for the same problem (measured speedup: 5.3065725974584295x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

         string a;

         cin>>a;

         int c=0,i;

         for(i=0;i<a.size();i++)

        {

           if(a[i]=='7') c++;

        }

 

         if(c>0) cout<<"Yes"<<endl;

         else cout<<"No"<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.353047782632228x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main()

{

    int n;



    cin >> n;



    while (n)

    {

        if (n % 10 == 7)

        {

            cout << "Yes\n";

            return 0;

        }

        n/=10;

    }

    cout<<"No\n";

}

// Faster C++ solution for the same problem (measured speedup: 5.307721602773595x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



#define     bip(a)         __builtin_popcount(a)

#define     ull            unsigned long long

#define     ll             long long

#define     u              unsigned

#define     pb             push_back

#define     pf             push_front ///for list

#define     mp             make_pair

#define     is             insert

#define     ff             first

#define     ss             second

#define     vi             vector<int>

#define     vl             vector<ll>

#define     si             set<int>

#define     sl             set<ll>

#define     li             list<int>

#define     pii            pair<int,int>

#define     pll            pair<ll,ll>

#define     mii            map<int,int>

#define     mll            map<ll,ll>

#define     ma             INT_MAX

#define     mi             INT_MIN

#define     mod            1000000007

#define     pi             3.14159265359

#define     e              2.71828182846

#define     inf            1000000000000000LL

#define     all(x)         x.begin(), x.end()

#define     lb(a,b,c)      lower_bound(a,a+b,c)-a

#define     ub(a,b,c)      upper_bound(a,a+b,c)-a

#define     lbv(a,c)       lower_bound(all(a),c)-a.begin()

#define     ubv(a,c)       upper_bound(all(a),c)-a.begin()

#define     srt1(a,b)      sort(a,a+b)

#define     srt2(a,b)      sort(a,a+b,greater<int>())

#define     gcd(a,b)       __gcd(a,b)

#define     lcm(a,b)       (a*(b/gcd(a,b)))

#define     harmonic(n)    0.57721566490153286l+log(n)

#define     mem(a, b)      memset(a, b, sizeof(a))



///s.lower_bound(a),s.upper_bound(a), for set

///nCr(x, y) = nCr(x-1, y-1) + nCr(x-1, y)

///factorial digit   ((n * log10(n / e) +log10(2 * pi * n) /2.0));



int main()

{

	/*int n,q,l,r,ac=0;

	string str;

	cin>>n>>q>>str;

	int pre[n+5];

	mem(pre,0);

	for(int i=0;i<n;){

		if(str[i]=='A'&&str[i+1]=='C'){

			ac++;

			pre[i+2]=ac;

			pre[i+1]=ac-1;

			i+=2;

		}

		else{

			pre[i+1]=ac;

			i++;

		}

	}*/

	/*for(int i=1;i<=n;i++)cout<<pre[i]<<" ";

	cout<<endl;*/

	/*while(q--){

		cin>>l>>r;

		cout<<pre[r]-pre[l]<<endl;

	}*/

	/*char ch;

	cin>>ch;

	if(ch=='A')cout<<"T\n";

	if(ch=='T')cout<<"A\n";

	if(ch=='G')cout<<"C\n";

	if(ch=='C')cout<<"G\n";*/

	string str;

	cin>>str;

	if(count(str.begin(),str.end(),'7')>0)cout<<"Yes\n";

	else cout<<"No\n";

}


// Faster C++ solution for the same problem (measured speedup: 5.338291053605669x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

int n,a,b,c;

cin>>n;

a=n/100;

b=n/10%10;

c=n%10;

if (a==7 or b==7 or c==7)cout<<"Yes"<<endl;

else if (a==7 and b==7 and c==7)cout<<"Yes"<<endl;

else if (a==7 and b==7)cout<<"Yes"<<endl;

else if (a==7 and c==7)cout<<"Yes"<<endl;

else if (b==7 and c==7)cout<<"Yes"<<endl;

else cout<<"No"<<endl;

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.317190408902837x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



typedef long long ll;



#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);



#define endl "\n"



int main()

{

	faster;

	

	int n;

	cin >> n;

	bool contains = false;

	while(n > 0){

		if(n%10 == 7) contains = true;

		n /= 10;

	}



	cout << (contains ? "Yes" : "No") << endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.384825658123128x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()

{

    string num;



    cin >> num;



    for(int i=0; i<num.size(); i++)

    {

        if(num[i] == '7')

        {

            cout << "Yes";

            return 0;

        }

    }

    

    cout << "No";





}


// Faster C++ solution for the same problem (measured speedup: 5.338232136314117x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using  namespace  std;



int main() {



    int n;

    cin>>n;



    bool flag = false;

    while(n){

        int rem = n%10;

        if(rem==7){

            flag = true;

            break;

        }

        n = n/10;

    }



    if(flag){

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

}


// Faster C++ solution for the same problem (measured speedup: 5.307745848937187x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>



using namespace std;



int main()

{

    string line;

    cin >> line;



    for(int i=0; i<line.size(); i++)

    {

        if(line[i]=='7')

        {

            cout<<"Yes\n";

            return 0;

        }

    }



    cout<<"No\n";



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.33805393734809x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define io ios_base::sync_with_stdio(false); cin.tie(NULL);



#define N 10000000

#define nl "\n"

#define pb push_back

#define MOD 1000000007

#define pi acos(-1)

#define f first

#define s second



typedef long long ll;

typedef double dd;

//typedef vector<int> vi;

//typedef vector<ll> vll;



using namespace std;



bool seven(int x)

{

    int mod;

    while(x!=0)

    {

        mod = x%10;

        if(mod == 7)

        {

            return true;

            break;

        }

        x = x/ 10;

    }

    return false;

}



int main()

{

    io;

    //freopen("in.txt" , "r" , stdin);

    //freopen("out.txt" , "w" , stdout);



    ///Let the showdown begin



    int t;

    cin >> t;



    if(seven(t))

        cout << "Yes" << nl;

    else

        cout << "No" << nl;



    /// Atlast DONE 

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.383956989845583x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string n;

int main()

{

    int i,c=0;

    cin>>n;

    for(i=0;i<n.length();i++)

    {

        if(n[i]=='7')

        {

            cout<<"Yes\n";

            c=1;

            break;

        }

    }

    if(c==0)

    {

        cout<<"No\n";

    }



return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.298962343935995x):
#include <stdio.h>



int main()

{

	int n;

	scanf("%d", &n);

	

	if(n%10==7){

		printf("Yes\n");

	}

	else if((n/10)%10==7){

		printf("Yes\n");

	}

	else if(n/100==7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main() {

string z,x;

cin>>x;

z="7";

int length,c;

length=x.size();

for(c=0;c<=length;c=c+1){

    if(z[0]==x[c]){

        cout<<"Yes";

        return 0;

    }

    }

    cout<<"No\n";

return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.34449990960678x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

	const int maxn=55;

	int a[maxn][maxn];

	int n;

	int main(){

		IOS

		bool ans=1;

		string s;

		cin>>s;

		if(s[0]=='7'||s[1]=='7'||s[2]=='7')

			cout<<"Yes"<<endl;

		else

			cout<<"No"<<endl;

		return 0;

	} 

// Faster C++ solution for the same problem (measured speedup: 5.432394354779132x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

	int n,cnt=0;

	cin>>n;

	while(n)

	{

		if(n%10==7)

		   cnt++;

		n/=10;

	}

	if(cnt==0)

	    cout<<"No"<<endl;

	else

	    cout<<"Yes"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.317705271204247x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



 int main()

 {

 	int n;

 	cin>>n;

 	if(n%10 == 7 || n/10%10 == 7 || n/100 == 7)

 	    cout<<"Yes"<<endl;

 	else cout<<"No"<<endl;

 	

 	return 0;

 }

// Faster C++ solution for the same problem (measured speedup: 5.3188035307386485x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	string n; 

	cin>>n;

	if(n[0]=='7'||n[1]=='7'||n[2]=='7')

	cout<<"Yes";

	else

	cout<<"No";



} 


// Faster C++ solution for the same problem (measured speedup: 5.295705940334096x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



#define forn(i, n) for (int i = 0; i < int(n); ++i)

#define for1(i, n) for (int i = 1; i <= int(n); ++i)

#define ms(a, x) memset(a, x, sizeof(a))

#define F first

#define S second

#define all(x) (x).begin(),(x).end()



using namespace std;

typedef long long ll;

typedef pair<int, int> pii;

const int INF = 0x3f3f3f3f;

mt19937 gen(random_device{}());



int main() {

    ios::sync_with_stdio(false);

    cin.tie(nullptr);

    string st;

    cin>>st;

    if(st.find('7')!=st.npos) cout<<"Yes";

    else cout<<"No";

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.4664986985458395x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    for(int i=0;i<3;i++)

    {

        char cc;

        cc=getchar();

        if(cc=='7'){cout<<"Yes"<<endl;return 0;}

    }

    cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.264197579393163x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

int main(){

    int n;

    cin>>n;

    if(n%10==7||n/10%10==7||n/100==7){

        cout<<"Yes";

    }

    else cout<<"No";

}


// Faster C++ solution for the same problem (measured speedup: 5.306671879049486x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

         string a;

         cin>>a;

         int c=0,i;

         for(i=0;i<a.size();i++)

        {

           if(a[i]=='7') c++;

        }

 

         if(c>0) cout<<"Yes"<<endl;

         else cout<<"No"<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.353147933735619x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main()

{

    int n;



    cin >> n;



    while (n)

    {

        if (n % 10 == 7)

        {

            cout << "Yes\n";

            return 0;

        }

        n/=10;

    }

    cout<<"No\n";

}

// Faster C++ solution for the same problem (measured speedup: 5.307820905861593x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



#define     bip(a)         __builtin_popcount(a)

#define     ull            unsigned long long

#define     ll             long long

#define     u              unsigned

#define     pb             push_back

#define     pf             push_front ///for list

#define     mp             make_pair

#define     is             insert

#define     ff             first

#define     ss             second

#define     vi             vector<int>

#define     vl             vector<ll>

#define     si             set<int>

#define     sl             set<ll>

#define     li             list<int>

#define     pii            pair<int,int>

#define     pll            pair<ll,ll>

#define     mii            map<int,int>

#define     mll            map<ll,ll>

#define     ma             INT_MAX

#define     mi             INT_MIN

#define     mod            1000000007

#define     pi             3.14159265359

#define     e              2.71828182846

#define     inf            1000000000000000LL

#define     all(x)         x.begin(), x.end()

#define     lb(a,b,c)      lower_bound(a,a+b,c)-a

#define     ub(a,b,c)      upper_bound(a,a+b,c)-a

#define     lbv(a,c)       lower_bound(all(a),c)-a.begin()

#define     ubv(a,c)       upper_bound(all(a),c)-a.begin()

#define     srt1(a,b)      sort(a,a+b)

#define     srt2(a,b)      sort(a,a+b,greater<int>())

#define     gcd(a,b)       __gcd(a,b)

#define     lcm(a,b)       (a*(b/gcd(a,b)))

#define     harmonic(n)    0.57721566490153286l+log(n)

#define     mem(a, b)      memset(a, b, sizeof(a))



///s.lower_bound(a),s.upper_bound(a), for set

///nCr(x, y) = nCr(x-1, y-1) + nCr(x-1, y)

///factorial digit   ((n * log10(n / e) +log10(2 * pi * n) /2.0));



int main()

{

	/*int n,q,l,r,ac=0;

	string str;

	cin>>n>>q>>str;

	int pre[n+5];

	mem(pre,0);

	for(int i=0;i<n;){

		if(str[i]=='A'&&str[i+1]=='C'){

			ac++;

			pre[i+2]=ac;

			pre[i+1]=ac-1;

			i+=2;

		}

		else{

			pre[i+1]=ac;

			i++;

		}

	}*/

	/*for(int i=1;i<=n;i++)cout<<pre[i]<<" ";

	cout<<endl;*/

	/*while(q--){

		cin>>l>>r;

		cout<<pre[r]-pre[l]<<endl;

	}*/

	/*char ch;

	cin>>ch;

	if(ch=='A')cout<<"T\n";

	if(ch=='T')cout<<"A\n";

	if(ch=='G')cout<<"C\n";

	if(ch=='C')cout<<"G\n";*/

	string str;

	cin>>str;

	if(count(str.begin(),str.end(),'7')>0)cout<<"Yes\n";

	else cout<<"No\n";

}


// Faster C++ solution for the same problem (measured speedup: 5.338390928622847x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

int n,a,b,c;

cin>>n;

a=n/100;

b=n/10%10;

c=n%10;

if (a==7 or b==7 or c==7)cout<<"Yes"<<endl;

else if (a==7 and b==7 and c==7)cout<<"Yes"<<endl;

else if (a==7 and b==7)cout<<"Yes"<<endl;

else if (a==7 and c==7)cout<<"Yes"<<endl;

else if (b==7 and c==7)cout<<"Yes"<<endl;

else cout<<"No"<<endl;

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.317289889144377x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



typedef long long ll;



#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);



#define endl "\n"



int main()

{

	faster;

	

	int n;

	cin >> n;

	bool contains = false;

	while(n > 0){

		if(n%10 == 7) contains = true;

		n /= 10;

	}



	cout << (contains ? "Yes" : "No") << endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.384926403764327x):
#include <stdio.h>



int main (){

	int n;

	

	scanf("%d", &n);

	

	if (n % 10 == 7){

		printf("Yes");

	}

	else if ((n/10) %10 == 7){

		printf("Yes");

	}

	else if (n/100 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	

	return 0;

}