stablegradients/pie-gem5-pairs huggingface dataset:
// 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.318741900404826x):
#include <stdio.h>

 

int main() {

	int N;

	int x, y, z;

	scanf("%d", &N);

	

	x = N / 100;

	y = (N - (x * 100)) / 10 ;

	z = N % 10;

	if(x == 7 || y == 7 || z == 7){

		puts("Yes");

	}

	else {

		puts("No");

	}

	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.3186539638982095x):
#include <stdio.h>

 

int main() {

	int N;

	int x, y, z;

	scanf("%d", &N);

	

	x = N / 100;

	y = (N - (x * 100)) / 10 ;

	z = N % 10;

	if(x == 7 || y == 7 || z == 7){

		puts("Yes");

	}

	else {

		puts("No");

	}

	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.3505711870435535x):
#include <stdio.h>

 

int main() {

	int N;

	int x, y, z;

	scanf("%d", &N);

	

	x = N / 100;

	y = (N - (x * 100)) / 10 ;

	z = N % 10;

	if(x == 7 || y == 7 || z == 7){

		puts("Yes");

	}

	else {

		puts("No");

	}

	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.349227340254488x):
#include <stdio.h>

 

int main() {

	int N;

	int x, y, z;

	scanf("%d", &N);

	

	x = N / 100;

	y = (N - (x * 100)) / 10 ;

	z = N % 10;

	if(x == 7 || y == 7 || z == 7){

		puts("Yes");

	}

	else {

		puts("No");

	}

	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.395136958778583x):
#include <stdio.h>

 

int main() {

	int N;

	int x, y, z;

	scanf("%d", &N);

	

	x = N / 100;

	y = (N - (x * 100)) / 10 ;

	z = N % 10;

	if(x == 7 || y == 7 || z == 7){

		puts("Yes");

	}

	else {

		puts("No");

	}

	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.114469348888008x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.328222497800036x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.328549379626618x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.326336993945184x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.317457902830545x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.3186471478029205x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.31855921286288x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.350475867407605x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.349132044558971x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.395040845209988x):
#include <stdio.h>



int main(){

    int n, x,y,z;

    scanf("%d", &n);

    x = n / 100;

    y = ((n-(x*100))/10);

    z = n-(x*100)-(y*10);

    if(x == 7 | y == 7 | z == 7){

        puts("Yes");

    }

    else {

        puts("No");

    }

    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.099961525146955x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.317357188096611x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.317683403345871x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.315475529160649x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.30661454428592x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.307801364150309x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.307713608527171x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.339565178639617x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.3382240961141285x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.384039279552765x):
#include <stdio.h>

int main(){

	int a, b ,c, d, e, f;

	scanf("%d", &a);

	b= a/100;

	c= b*100;

	d= a-c;

	e= d%10;

	f= d/10;

	if (b==7){

		printf("Yes\n");

	}

	else if(e==7){

		printf("Yes\n");

	}

	else if(f==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.111422080159505x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	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.325940314126199x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	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.326267055942793x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	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.324055617870151x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	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.31518032984684x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	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.31636906544194x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	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.316281168166183x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	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.348184152172946x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	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.3468409049103665x):
#include <stdio.h>

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	return 0;

}