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



int main(){

	int N;

	scanf("%d", &N);



	if (N / 100 == 7){

		puts("Yes");

	}else if ((N % 100)/10 == 7){

		puts("Yes");

	}else if (N % 10 == 7){

		puts("Yes");

	}else{

		puts("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.306681339623635x):
#include<stdio.h>



int main(){

	int n;

	scanf("%d", &n);

	

	int ratusan = 0, puluhan = 0, satuan= 0;

	

	ratusan = n / 100;

	puluhan = (n / 10) - (ratusan * 10); //misal n = 271, 271 - 2

	satuan = n % 10;

	

	if(ratusan == 7 || puluhan == 7 || satuan == 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.308035445146935x):
#include<stdio.h>



int main(){

	int n;

	scanf("%d", &n);

	

	int ratusan = 0, puluhan = 0, satuan= 0;

	

	ratusan = n / 100;

	puluhan = (n / 10) - (ratusan * 10); //misal n = 271, 271 - 2

	satuan = n % 10;

	

	if(ratusan == 7 || puluhan == 7 || satuan == 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;



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



int main(){

	int n;

	scanf("%d", &n);

	

	int ratusan = 0, puluhan = 0, satuan= 0;

	

	ratusan = n / 100;

	puluhan = (n / 10) - (ratusan * 10); //misal n = 271, 271 - 2

	satuan = n % 10;

	

	if(ratusan == 7 || puluhan == 7 || satuan == 7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

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



int main(){

	int n;

	scanf("%d", &n);

	

	int ratusan = 0, puluhan = 0, satuan= 0;

	

	ratusan = n / 100;

	puluhan = (n / 10) - (ratusan * 10); //misal n = 271, 271 - 2

	satuan = n % 10;

	

	if(ratusan == 7 || puluhan == 7 || satuan == 7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

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



int main(){

	int n;

	scanf("%d", &n);

	

	int ratusan = 0, puluhan = 0, satuan= 0;

	

	ratusan = n / 100;

	puluhan = (n / 10) - (ratusan * 10); //misal n = 271, 271 - 2

	satuan = n % 10;

	

	if(ratusan == 7 || puluhan == 7 || satuan == 7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

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



int main(){

	int n;

	scanf("%d", &n);

	

	int ratusan = 0, puluhan = 0, satuan= 0;

	

	ratusan = n / 100;

	puluhan = (n / 10) - (ratusan * 10); //misal n = 271, 271 - 2

	satuan = n % 10;

	

	if(ratusan == 7 || puluhan == 7 || satuan == 7){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

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



int main(){

	int n;

	scanf("%d", &n);

	

	int ratusan = 0, puluhan = 0, satuan= 0;

	

	ratusan = n / 100;

	puluhan = (n / 10) - (ratusan * 10); //misal n = 271, 271 - 2

	satuan = n % 10;

	

	if(ratusan == 7 || puluhan == 7 || satuan == 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.3066720199341075x):
#include <stdio.h>

int main (){

	int numberS, a, b, c;

	scanf("%d", &numberS);

  a = numberS%10;

  b = numberS/100;

  c = numberS%100/10;

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

		printf("Yes");

	}

	else{

		printf("No");

	}





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

int main (){

	int numberS, a, b, c;

	scanf("%d", &numberS);

  a = numberS%10;

  b = numberS/100;

  c = numberS%100/10;

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

		printf("Yes");

	}

	else{

		printf("No");

	}





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

int main (){

	int numberS, a, b, c;

	scanf("%d", &numberS);

  a = numberS%10;

  b = numberS/100;

  c = numberS%100/10;

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

		printf("Yes");

	}

	else{

		printf("No");

	}





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

int main (){

	int numberS, a, b, c;

	scanf("%d", &numberS);

  a = numberS%10;

  b = numberS/100;

  c = numberS%100/10;

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

		printf("Yes");

	}

	else{

		printf("No");

	}





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

int main (){

	int numberS, a, b, c;

	scanf("%d", &numberS);

  a = numberS%10;

  b = numberS/100;

  c = numberS%100/10;

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

		printf("Yes");

	}

	else{

		printf("No");

	}





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

int main (){

	int numberS, a, b, c;

	scanf("%d", &numberS);

  a = numberS%10;

  b = numberS/100;

  c = numberS%100/10;

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

		printf("Yes");

	}

	else{

		printf("No");

	}





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

int main (){

	int numberS, a, b, c;

	scanf("%d", &numberS);

  a = numberS%10;

  b = numberS/100;

  c = numberS%100/10;

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

		printf("Yes");

	}

	else{

		printf("No");

	}





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

 

int main(){

 

 int B;

 scanf("%d", &B);

 

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

  

  puts("Yes");

  

 }else{

  

  puts ("No");

  

 }

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

 

int main(){

 

 int B;

 scanf("%d", &B);

 

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

  

  puts("Yes");

  

 }else{

  

  puts ("No");

  

 }

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

 

int main(){

 

 int B;

 scanf("%d", &B);

 

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

  

  puts("Yes");

  

 }else{

  

  puts ("No");

  

 }

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

 

int main(){

 

 int B;

 scanf("%d", &B);

 

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

  

  puts("Yes");

  

 }else{

  

  puts ("No");

  

 }

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

 

int main(){

 

 int B;

 scanf("%d", &B);

 

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

  

  puts("Yes");

  

 }else{

  

  puts ("No");

  

 }

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

 

int main(){

 

 int B;

 scanf("%d", &B);

 

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

  

  puts("Yes");

  

 }else{

  

  puts ("No");

  

 }

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

 

int main(){

 

 int B;

 scanf("%d", &B);

 

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

  

  puts("Yes");

  

 }else{

  

  puts ("No");

  

 }

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

int main() {

	

	int num, fnt, mdl, bck;

	scanf("%d", &num);

	

	fnt = num / 100;

	mdl = num / 10 % 10;

	bck = num % 100 % 10;

	

	if (fnt != 7){

		if (mdl != 7){

			if (bck != 7){

				printf("No");

			}

			else printf("Yes");

		}

		else printf("Yes");

	}

	else printf("Yes");



	

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

int main() {

	

	int num, fnt, mdl, bck;

	scanf("%d", &num);

	

	fnt = num / 100;

	mdl = num / 10 % 10;

	bck = num % 100 % 10;

	

	if (fnt != 7){

		if (mdl != 7){

			if (bck != 7){

				printf("No");

			}

			else printf("Yes");

		}

		else printf("Yes");

	}

	else printf("Yes");



	

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

int main() {

	

	int num, fnt, mdl, bck;

	scanf("%d", &num);

	

	fnt = num / 100;

	mdl = num / 10 % 10;

	bck = num % 100 % 10;

	

	if (fnt != 7){

		if (mdl != 7){

			if (bck != 7){

				printf("No");

			}

			else printf("Yes");

		}

		else printf("Yes");

	}

	else printf("Yes");



	

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

int main() {

	

	int num, fnt, mdl, bck;

	scanf("%d", &num);

	

	fnt = num / 100;

	mdl = num / 10 % 10;

	bck = num % 100 % 10;

	

	if (fnt != 7){

		if (mdl != 7){

			if (bck != 7){

				printf("No");

			}

			else printf("Yes");

		}

		else printf("Yes");

	}

	else printf("Yes");



	

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

int main() {

	

	int num, fnt, mdl, bck;

	scanf("%d", &num);

	

	fnt = num / 100;

	mdl = num / 10 % 10;

	bck = num % 100 % 10;

	

	if (fnt != 7){

		if (mdl != 7){

			if (bck != 7){

				printf("No");

			}

			else printf("Yes");

		}

		else printf("Yes");

	}

	else printf("Yes");



	

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

int main() {

	

	int num, fnt, mdl, bck;

	scanf("%d", &num);

	

	fnt = num / 100;

	mdl = num / 10 % 10;

	bck = num % 100 % 10;

	

	if (fnt != 7){

		if (mdl != 7){

			if (bck != 7){

				printf("No");

			}

			else printf("Yes");

		}

		else printf("Yes");

	}

	else printf("Yes");



	

	return 0;

}