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

#define ll long long

#define nl "\n"

#define pi acos(-1)

#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

#define pcase printf("Case %d:\n",ca)

int ca=1;

using namespace std;

int main(){

    string a;

    cin>>a;

    bool ans = false;

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

        if(a[i]-'0'==7){

            ans = true;

        }

    }

    if(ans == true){

        cout<<"Yes"<<nl;

    }else{

    cout<<"No"<<nl;}

}


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



int main() {

	char num[10];

	scanf("%s", num);

	//987

	//num[0] = '9'; num[1] = '8'; num[2] = '7';

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

    string s;

    int i;

    cin >> s;



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

    {

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

        {



            cout<<"Yes";

            return 0;

        }



    }

    cout<<"No";

}


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



int main() {

	char num[10];

	scanf("%s", num);

	//987

	//num[0] = '9'; num[1] = '8'; num[2] = '7';

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    int n;

    cin >> n;

    int a,cnt=0;

    while( n != 0)

    {

        a = n % 10;

        n = n / 10;

        if(a == 7)

        {

            cnt++;

            break;

        }

    }

    if(cnt > 0)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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



int main() {

	char num[10];

	scanf("%s", num);

	//987

	//num[0] = '9'; num[1] = '8'; num[2] = '7';

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

#include<cstdio>

#include<iomanip>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<vector>

#include<map>

using namespace std;

string s[10005];

int main() 

{

	int n;

    cin>>n;

    int flag=0;

    while (n!=0)

    {

        int m=n%10;

        if (m==7)

        {

            flag=1;

            break;

        }

        n=n/10;

    }

    if (flag)

    cout<<"Yes"<<endl;

    else

    cout<<"No"<<endl;

    return 0;

}




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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

using namespace std;

int main()

{

	int n;

	cin>>n;

	if(n/100!=7&&n%10!=7&&(n%100)/10!=7)

		cout<<"No"<<endl;

	else cout<<"Yes"<<endl;

	

	return 0; 

}

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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

using namespace std;

int  main(){

	int n,flag=0;

	cin>>n;

	while(n){

		int x=n%10;

		n/=10;

		if(x==7){

			flag=1;

			break;

		}

	}

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

	else cout<<"No"<<endl;

}

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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

using namespace std;

int main()

{

    int t;

    scanf("%d",&t);

    while(t>0)

    {

        int x=t%10;

        t/=10;

        if(x==7)

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

}


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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

using namespace std;

int main(){

   int n;

   cin>>n;

   if(n%10==7)

      cout<<"Yes";

   else{

      n/=10;

      if(n%10==7)

      cout<<"Yes";

      else{

         n/=10;

         if(n==7)

            cout<<"Yes";

         else cout<<"No";

      }

   }

}


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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

using namespace std;

int main(){

  string st;

  cin>>st;

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

    cout<<"Yes"<<endl;

  }else{

    cout<<"No"<<endl;

  }

  

  return 0;

}

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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

using namespace std;







int main()

{

    int N,digit,temp=0;

    cin >> N;

    while (N != 0)

    {

        digit = N % 10;

        if (digit == 7)

        {

            temp=1;

            break;

        }

        N = N / 10;

    }

    if (temp == 1)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

#define ll long long

#define nl "\n"

#define pi acos(-1)

#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

#define pcase printf("Case %d:\n",ca)

int ca=1;

using namespace std;

int main(){

    string a;

    cin>>a;

    bool ans = false;

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

        if(a[i]-'0'==7){

            ans = true;

        }

    }

    if(ans == true){

        cout<<"Yes"<<nl;

    }else{

    cout<<"No"<<nl;}

}


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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

using namespace std;

int main()

{

    string s;

    int i;

    cin >> s;



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

    {

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

        {



            cout<<"Yes";

            return 0;

        }



    }

    cout<<"No";

}


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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    int n;

    cin >> n;

    int a,cnt=0;

    while( n != 0)

    {

        a = n % 10;

        n = n / 10;

        if(a == 7)

        {

            cnt++;

            break;

        }

    }

    if(cnt > 0)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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



int main (){

	char num[10];

	scanf("%s", num);

	

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

		printf("Yes\n");

	}else {

		printf("No\n");

	}



	return 0;

	

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

#include<cstdio>

#include<iomanip>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<vector>

#include<map>

using namespace std;

string s[10005];

int main() 

{

	int n;

    cin>>n;

    int flag=0;

    while (n!=0)

    {

        int m=n%10;

        if (m==7)

        {

            flag=1;

            break;

        }

        n=n/10;

    }

    if (flag)

    cout<<"Yes"<<endl;

    else

    cout<<"No"<<endl;

    return 0;

}




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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

using namespace std;

int main()

{

	int n;

	cin>>n;

	if(n/100!=7&&n%10!=7&&(n%100)/10!=7)

		cout<<"No"<<endl;

	else cout<<"Yes"<<endl;

	

	return 0; 

}

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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

using namespace std;

int  main(){

	int n,flag=0;

	cin>>n;

	while(n){

		int x=n%10;

		n/=10;

		if(x==7){

			flag=1;

			break;

		}

	}

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

	else cout<<"No"<<endl;

}

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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

using namespace std;

int main()

{

    int t;

    scanf("%d",&t);

    while(t>0)

    {

        int x=t%10;

        t/=10;

        if(x==7)

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

}


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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

using namespace std;

int main(){

   int n;

   cin>>n;

   if(n%10==7)

      cout<<"Yes";

   else{

      n/=10;

      if(n%10==7)

      cout<<"Yes";

      else{

         n/=10;

         if(n==7)

            cout<<"Yes";

         else cout<<"No";

      }

   }

}


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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

using namespace std;

int main(){

  string st;

  cin>>st;

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

    cout<<"Yes"<<endl;

  }else{

    cout<<"No"<<endl;

  }

  

  return 0;

}

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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

using namespace std;







int main()

{

    int N,digit,temp=0;

    cin >> N;

    while (N != 0)

    {

        digit = N % 10;

        if (digit == 7)

        {

            temp=1;

            break;

        }

        N = N / 10;

    }

    if (temp == 1)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

#define ll long long

#define nl "\n"

#define pi acos(-1)

#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

#define pcase printf("Case %d:\n",ca)

int ca=1;

using namespace std;

int main(){

    string a;

    cin>>a;

    bool ans = false;

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

        if(a[i]-'0'==7){

            ans = true;

        }

    }

    if(ans == true){

        cout<<"Yes"<<nl;

    }else{

    cout<<"No"<<nl;}

}


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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

using namespace std;

int main()

{

    string s;

    int i;

    cin >> s;



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

    {

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

        {



            cout<<"Yes";

            return 0;

        }



    }

    cout<<"No";

}


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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    int n;

    cin >> n;

    int a,cnt=0;

    while( n != 0)

    {

        a = n % 10;

        n = n / 10;

        if(a == 7)

        {

            cnt++;

            break;

        }

    }

    if(cnt > 0)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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



int main()

{

	int num, i, remind, save;

	scanf("%d", &num);

	

	i = 1; 

	while(num!=0)

	{

		remind = num % 10;

		num = num / 10;

		if(remind == 7)

		 {

		 	save = 1;

		 	break;

		 }

		 else {

		 	save = 2;

		 }

	}

	if(save == 1)

		printf("Yes\n");

	else 

		printf("No\n");

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

#include<cstdio>

#include<iomanip>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<vector>

#include<map>

using namespace std;

string s[10005];

int main() 

{

	int n;

    cin>>n;

    int flag=0;

    while (n!=0)

    {

        int m=n%10;

        if (m==7)

        {

            flag=1;

            break;

        }

        n=n/10;

    }

    if (flag)

    cout<<"Yes"<<endl;

    else

    cout<<"No"<<endl;

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.3379030522222513x):
#include <iostream>



using namespace std;

int a,b;

int main()

{

    cin>>a;

    while(a>0){

        b=a%10;

        if (b==7) {

            cout<<"Yes";

            return 0;

        }

        a/=10;

    }

    cout<<"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"<<endl;return 0;}n/=10;

    }cout<<"No";

}


// Faster C++ solution for the same problem (measured speedup: 5.304490468961893x):
#include <cstdio>

int main() {

	int a,b,c;

	scanf("%1d%1d%1d", &a, &b, &c);

	if (a == 7 || b == 7 || c == 7) 

		printf("Yes\n");

	else printf("No\n");

	return 0;

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

using namespace std;

string n;

int k;

int main(){

	cin>>n;

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

		k=n[i]-'0';

		if (k==7){

			cout<<"Yes"<<endl;

			return 0;

		}

	}

	cout<<"No"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.305844015440871x):
#include <cstdio>

int main() {

	int a,b,c;

	scanf("%1d%1d%1d", &a, &b, &c);

	if (a == 7 || b == 7 || c == 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"<<endl;return 0;}n/=10;

    }cout<<"No";

}


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



int main () {

	int a;

	scanf("%d",&a);

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

		printf("Yes");

	}

	else printf("No");

	

	return 0;

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

using namespace std;

string n;

int k;

int main(){

	cin>>n;

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

		k=n[i]-'0';

		if (k==7){

			cout<<"Yes"<<endl;

			return 0;

		}

	}

	cout<<"No"<<endl;

	return 0;

}

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



int main () {

	int a;

	scanf("%d",&a);

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

		printf("Yes");

	}

	else printf("No");

	

	return 0;

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

using namespace std;



int main(){

    int n;

    cin>>n;



   int cnt=0;

   while(n>0){

    int x=n%10;

    if(x ==7)cnt++;

    n/=10;

   }

   if(cnt>0)cout<<"Yes\n" ;

   else

    cout<<"No\n" ;









return 0;



}


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



int main () {

	int a;

	scanf("%d",&a);

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

		printf("Yes");

	}

	else printf("No");

	

	return 0;

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

using namespace std;

#define ll long long int



int main(){

    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

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

    int N;

    cin >> N;

    

    bool possible = false;

    while(N!=0){

        if(N%10==7){

            possible = true;

            break;

        }

        N/=10;

        

    }

    

    if(possible) cout << "Yes";

    else cout << "No";

}

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



int main () {

	int a;

	scanf("%d",&a);

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

		printf("Yes");

	}

	else printf("No");

	

	return 0;

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

#include<iostream>

//#include<map>

//#include<vector>

//#include<algorithm>

#define ll long long

#define endl "\n"

using namespace std;

//map<int,int>m;

/*

bool isprime[500+5];

vector<int>pf;

vector<int>arr;



void sieve()   // O(N lg lg N)

{

    int n=500; //sqrt of 2^31

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

    {

        isprime[i] = true;

    }

    isprime[0] = isprime[1] = false;

    for(int i = 2; i * i <= n; i++)

    {

        if(isprime[i] == true)

        {

            for(int j = i * i; j <= n; j += i)

            {

                isprime[j] = false;

            }

        }

    }

    for(int i=2; i<=n; i++)

    {

        if(isprime[i])

        {

            pf.push_back(i); //store the prime numbers upto 10^8

        }

    }

} */

bool check(int n)

{

    int r;

    while(n>0)

    {

        r=n%10;

        if(r==7)

        {

            return true;

        }



        n=n/10;

    }

    return false;

}



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(0);//NULL;

    // sieve();

    int t;

    cin>>t;

    if(check(t))

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }







}






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



int main () {

	int a;

	scanf("%d",&a);

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

		printf("Yes");

	}

	else printf("No");

	

	return 0;

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

#define ll long long

using namespace std;



int main()

{

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

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

	ios_base::sync_with_stdio(false);

	cin.tie(0);

	cout.tie(0);

	string str;

	cin >> str;

	for (int i = 0; i < str.length(); i++)

	{

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

		{

			cout << "Yes" << "\n";

			return 0;

		}

	}

	cout << "No" << "\n";

	return 0;

}

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



int main () {

	int a;

	scanf("%d",&a);

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

		printf("Yes");

	}

	else printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int n,res=0;

    scanf("%d",&n);

    while(1)

    {

    res=n%10;

    if(res-7==0){

        cout << "Yes" << "\n";

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

        cout << "Yes" << "\n";

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

        cout << "Yes" << "\n";

        break;

    }

        else{

        cout << "No" << "\n";

        return 0;

        }

    }

    return 0;

}


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



int main () {

	int a;

	scanf("%d",&a);

	if ((a%100)/10==7 || a/100==7 || (a%10)==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"<<endl;return 0;}n/=10;

    }cout<<"No";

}


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



int main () {

	int n;

	scanf("%d", &n);

	

	int firstDigit = n / 100;

	int secondDigit = (n / 10) % 10;

	int thirdDigit = n % 10;

	

	while ( n > 0) {

		if ( firstDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( secondDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( thirdDigit == 7) {

			puts("Yes");

			break;

		}

		else {

			puts("No");

			break;

		}

	} 

	return 0;

}