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

using namespace std;

int main()

{

    long long int n,m,s,c=0,i;

    cin>>n;

    for(i=1;i<10;i++){

        if(n%i==0)

        m=n/i;

        if(m>=1 && m<=9){

            cout<<"Yes\n";

            return 0;

        }

    }

    cout<<"No\n";

    return 0;

}


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



int main(){

	int a[9] = {1,2,3,4,5,6,7,8,9};

	int b[9] = {1,2,3,4,5,6,7,8,9};

	int in;

	int y = 0;

	scanf("%d" ,&in);

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

		for(int j = 0; j < 9; j++){

			if(a[i] * b[j] == in){

				y++;

			}

		}

	}

	if(y > 0){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
///Bismillahir Rahmanir Rahim

#include "bits/stdc++.h"



#define                           ll                          long long

#define                           int                         ll

#define                           fi                          first

#define                           si                          second

#define                           mp                          make_pair

#define                           pb                          push_back

#define                           pi                          pair<ll,ll>

#define                           clr(x)                      memset(x,0,sizeof(x));

#define                           f(i,l,r)                    for(int i=l;i<=r;i++)

#define                           rf(i,r,l)                   for(int i=r;i>=l;i--)

#define                           done(i)                     cout<<"done = "<<i<<endl;

#define                           show(x,y)                   cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;

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



using namespace std;



const ll inf=1e18;

const int mod=1e9+7;

const int M=100005;



 main()



{

    fast

    int n;

    cin>>n;

    f(i,1,9)

    {

        f(j,1,9)

        {

            if(i*j==n)

            {

                cout<<"Yes"<<endl;

                return  0;

            }

        }

    }

    cout<<"No"<<endl;

    return 0;



}








































































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



int main(){



	int n,x=0;

	scanf("%d",&n);

	

	if(n>=1 && n<=81){

		for(int i=1;i<=9;i++){

			for(int j=1;j<=9;j++){

			if(i*j == n && i>=j){

				printf("Yes");

				x++;

				break;

			}

		}

		if(x > 0){

			break;

		}

		}

		if(x == 0){

			printf("No");

		}

	}

	else {

		printf("No");

	}



	return 0;

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

using namespace std;

int main()

{

    long long n,i,j,a,b;

    cin>>n;

    for(i=1;i<=9;i++)

    {

        for(j=1;j<=9;j++)

        {

            if(i*j==n)

            {

                cout<<"Yes"<<endl;

                return 0;

            }

        }

    }

    cout<<"No"<<endl;

    return 0;

}


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



int main(){



	int n,x=0;

	scanf("%d",&n);

	

	if(n>=1 && n<=81){

		for(int i=1;i<=9;i++){

			for(int j=1;j<=9;j++){

			if(i*j == n && i>=j){

				printf("Yes");

				x++;

				break;

			}

		}

		if(x > 0){

			break;

		}

		}

		if(x == 0){

			printf("No");

		}

	}

	else {

		printf("No");

	}



	return 0;

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

using namespace std;



int main()

{

    int n, chk = 0;

    cin >> n;

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

        for(int j = 0; j < 10; j++){

            if(i*j == n){

                chk = 1;

            }

        }

    }

    if(chk == 1)

        cout << "Yes";

    else

        cout << "No";



    return 0;

}


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



int main(){



	int n,x=0;

	scanf("%d",&n);

	

	if(n>=1 && n<=81){

		for(int i=1;i<=9;i++){

			for(int j=1;j<=9;j++){

			if(i*j == n && i>=j){

				printf("Yes");

				x++;

				break;

			}

		}

		if(x > 0){

			break;

		}

		}

		if(x == 0){

			printf("No");

		}

	}

	else {

		printf("No");

	}



	return 0;

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

#define ll long long

using namespace std;

int main()

{

    int n,f = 0;

    cin>>n;

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

    {

        if(n % i == 0)

        {

            int d = n/i;

            if(i < 10 && d < 10){f = 1; break;}

        }

    }

    if(f)cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

}


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



int main(){



	int n,x=0;

	scanf("%d",&n);

	

	if(n>=1 && n<=81){

		for(int i=1;i<=9;i++){

			for(int j=1;j<=9;j++){

			if(i*j == n && i>=j){

				printf("Yes");

				x++;

				break;

			}

		}

		if(x > 0){

			break;

		}

		}

		if(x == 0){

			printf("No");

		}

	}

	else {

		printf("No");

	}



	return 0;

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

using namespace std;



int main() {

	int n;

		int count=0;

	cin>>n;

	if(n>81){

	    cout<<"No"<<endl;

	}

	else if(n<1){

	    cout<<"No"<<endl;

	}



	else {

	    for(int i=1;i<=9;i++){

	        if(n%i==0){

	            if(n/i<=9&n/i>=1){

	                cout<<"Yes";

	                count=1;

	                break;

	            }

	        }

	       }

	       if(count==0)

	       cout<<"No";

	    

	}

	return 0;

}

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



int main(){



	int n,x=0;

	scanf("%d",&n);

	

	if(n>=1 && n<=81){

		for(int i=1;i<=9;i++){

			for(int j=1;j<=9;j++){

			if(i*j == n && i>=j){

				printf("Yes");

				x++;

				break;

			}

		}

		if(x > 0){

			break;

		}

		}

		if(x == 0){

			printf("No");

		}

	}

	else {

		printf("No");

	}



	return 0;

}
// Slower C++ solution:
///Bismillahir Rahmanir Rahim

#include "bits/stdc++.h"



#define                           ll                          long long

#define                           int                         ll

#define                           fi                          first

#define                           si                          second

#define                           mp                          make_pair

#define                           pb                          push_back

#define                           pi                          pair<ll,ll>

#define                           clr(x)                      memset(x,0,sizeof(x));

#define                           f(i,l,r)                    for(int i=l;i<=r;i++)

#define                           rf(i,r,l)                   for(int i=r;i>=l;i--)

#define                           done(i)                     cout<<"done = "<<i<<endl;

#define                           show(x,y)                   cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;

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



using namespace std;



const ll inf=1e18;

const int mod=1e9+7;

const int M=100005;



 main()



{

    fast

    int n;

    cin>>n;

    f(i,1,9)

    {

        f(j,1,9)

        {

            if(i*j==n)

            {

                cout<<"Yes"<<endl;

                return  0;

            }

        }

    }

    cout<<"No"<<endl;

    return 0;



}








































































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

int main(){

	int num;

	scanf("%d", &num);

	int test;

	for (int i = 1 ; i <= 9 ; i++){

		for (int j = 1 ; j <= 9 ; j++){

			if(i * j ==num){

				test++;

				}

			}

		}

	if (test != 0){

		printf("Yes");

	}else {

		printf("No");

	}

    return 0;

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

using namespace std;

int main()

{

    long long n,i,j,a,b;

    cin>>n;

    for(i=1;i<=9;i++)

    {

        for(j=1;j<=9;j++)

        {

            if(i*j==n)

            {

                cout<<"Yes"<<endl;

                return 0;

            }

        }

    }

    cout<<"No"<<endl;

    return 0;

}


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

int main(){

	int num;

	scanf("%d", &num);

	int test;

	for (int i = 1 ; i <= 9 ; i++){

		for (int j = 1 ; j <= 9 ; j++){

			if(i * j ==num){

				test++;

				}

			}

		}

	if (test != 0){

		printf("Yes");

	}else {

		printf("No");

	}

    return 0;

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

using namespace std;



int main()

{

    int n, chk = 0;

    cin >> n;

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

        for(int j = 0; j < 10; j++){

            if(i*j == n){

                chk = 1;

            }

        }

    }

    if(chk == 1)

        cout << "Yes";

    else

        cout << "No";



    return 0;

}


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

int main(){

	int num;

	scanf("%d", &num);

	int test;

	for (int i = 1 ; i <= 9 ; i++){

		for (int j = 1 ; j <= 9 ; j++){

			if(i * j ==num){

				test++;

				}

			}

		}

	if (test != 0){

		printf("Yes");

	}else {

		printf("No");

	}

    return 0;

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

#define ll long long

using namespace std;

int main()

{

    int n,f = 0;

    cin>>n;

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

    {

        if(n % i == 0)

        {

            int d = n/i;

            if(i < 10 && d < 10){f = 1; break;}

        }

    }

    if(f)cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

}


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

int main(){

	int num;

	scanf("%d", &num);

	int test;

	for (int i = 1 ; i <= 9 ; i++){

		for (int j = 1 ; j <= 9 ; j++){

			if(i * j ==num){

				test++;

				}

			}

		}

	if (test != 0){

		printf("Yes");

	}else {

		printf("No");

	}

    return 0;

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

using namespace std;



int main() {

	int n;

		int count=0;

	cin>>n;

	if(n>81){

	    cout<<"No"<<endl;

	}

	else if(n<1){

	    cout<<"No"<<endl;

	}



	else {

	    for(int i=1;i<=9;i++){

	        if(n%i==0){

	            if(n/i<=9&n/i>=1){

	                cout<<"Yes";

	                count=1;

	                break;

	            }

	        }

	       }

	       if(count==0)

	       cout<<"No";

	    

	}

	return 0;

}

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

int main(){

	int num;

	scanf("%d", &num);

	int test;

	for (int i = 1 ; i <= 9 ; i++){

		for (int j = 1 ; j <= 9 ; j++){

			if(i * j ==num){

				test++;

				}

			}

		}

	if (test != 0){

		printf("Yes");

	}else {

		printf("No");

	}

    return 0;

}
// Slower C++ solution:
///Bismillahir Rahmanir Rahim

#include "bits/stdc++.h"



#define                           ll                          long long

#define                           int                         ll

#define                           fi                          first

#define                           si                          second

#define                           mp                          make_pair

#define                           pb                          push_back

#define                           pi                          pair<ll,ll>

#define                           clr(x)                      memset(x,0,sizeof(x));

#define                           f(i,l,r)                    for(int i=l;i<=r;i++)

#define                           rf(i,r,l)                   for(int i=r;i>=l;i--)

#define                           done(i)                     cout<<"done = "<<i<<endl;

#define                           show(x,y)                   cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;

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



using namespace std;



const ll inf=1e18;

const int mod=1e9+7;

const int M=100005;



 main()



{

    fast

    int n;

    cin>>n;

    f(i,1,9)

    {

        f(j,1,9)

        {

            if(i*j==n)

            {

                cout<<"Yes"<<endl;

                return  0;

            }

        }

    }

    cout<<"No"<<endl;

    return 0;



}








































































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

#include<math.h>



int main(){

	int a;

	scanf("%d", &a);

	

	for(int i = 1;i <= 9; i++){

		for(int j = 1; j <= 9; j++){

			if(i * j == a){

				printf("Yes\n");

				return 0;

			}

		}

	}

	printf("No\n");

	return 0;

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

using namespace std;

int main()

{

    long long n,i,j,a,b;

    cin>>n;

    for(i=1;i<=9;i++)

    {

        for(j=1;j<=9;j++)

        {

            if(i*j==n)

            {

                cout<<"Yes"<<endl;

                return 0;

            }

        }

    }

    cout<<"No"<<endl;

    return 0;

}


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

#include<math.h>



int main(){

	int a;

	scanf("%d", &a);

	

	for(int i = 1;i <= 9; i++){

		for(int j = 1; j <= 9; j++){

			if(i * j == a){

				printf("Yes\n");

				return 0;

			}

		}

	}

	printf("No\n");

	return 0;

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

using namespace std;



int main()

{

    int n, chk = 0;

    cin >> n;

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

        for(int j = 0; j < 10; j++){

            if(i*j == n){

                chk = 1;

            }

        }

    }

    if(chk == 1)

        cout << "Yes";

    else

        cout << "No";



    return 0;

}


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

#include<math.h>



int main(){

	int a;

	scanf("%d", &a);

	

	for(int i = 1;i <= 9; i++){

		for(int j = 1; j <= 9; j++){

			if(i * j == a){

				printf("Yes\n");

				return 0;

			}

		}

	}

	printf("No\n");

	return 0;

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

#define ll long long

using namespace std;

int main()

{

    int n,f = 0;

    cin>>n;

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

    {

        if(n % i == 0)

        {

            int d = n/i;

            if(i < 10 && d < 10){f = 1; break;}

        }

    }

    if(f)cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

}


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

#include<math.h>



int main(){

	int a;

	scanf("%d", &a);

	

	for(int i = 1;i <= 9; i++){

		for(int j = 1; j <= 9; j++){

			if(i * j == a){

				printf("Yes\n");

				return 0;

			}

		}

	}

	printf("No\n");

	return 0;

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

using namespace std;



int main() {

	int n;

		int count=0;

	cin>>n;

	if(n>81){

	    cout<<"No"<<endl;

	}

	else if(n<1){

	    cout<<"No"<<endl;

	}



	else {

	    for(int i=1;i<=9;i++){

	        if(n%i==0){

	            if(n/i<=9&n/i>=1){

	                cout<<"Yes";

	                count=1;

	                break;

	            }

	        }

	       }

	       if(count==0)

	       cout<<"No";

	    

	}

	return 0;

}

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

#include<math.h>



int main(){

	int a;

	scanf("%d", &a);

	

	for(int i = 1;i <= 9; i++){

		for(int j = 1; j <= 9; j++){

			if(i * j == a){

				printf("Yes\n");

				return 0;

			}

		}

	}

	printf("No\n");

	return 0;

}
// Slower C++ solution:
///Bismillahir Rahmanir Rahim

#include "bits/stdc++.h"



#define                           ll                          long long

#define                           int                         ll

#define                           fi                          first

#define                           si                          second

#define                           mp                          make_pair

#define                           pb                          push_back

#define                           pi                          pair<ll,ll>

#define                           clr(x)                      memset(x,0,sizeof(x));

#define                           f(i,l,r)                    for(int i=l;i<=r;i++)

#define                           rf(i,r,l)                   for(int i=r;i>=l;i--)

#define                           done(i)                     cout<<"done = "<<i<<endl;

#define                           show(x,y)                   cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;

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



using namespace std;



const ll inf=1e18;

const int mod=1e9+7;

const int M=100005;



 main()



{

    fast

    int n;

    cin>>n;

    f(i,1,9)

    {

        f(j,1,9)

        {

            if(i*j==n)

            {

                cout<<"Yes"<<endl;

                return  0;

            }

        }

    }

    cout<<"No"<<endl;

    return 0;



}








































































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



int main(){

	int n;

	scanf("%d", &n);

	

	for(int i = 1; i < 10; i++){

		int flag = 0;

		for(int j = 1; j < 10; j++){

			if(i * j == n){

				flag = 1;

			}

		}

		

		if(flag == 1){

			printf("Yes");

			break;

		}

		else if(i == 9 && flag == 0){

			printf("No");

		}

	}

	

	return 0;

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

using namespace std;

int main()

{

    long long n,i,j,a,b;

    cin>>n;

    for(i=1;i<=9;i++)

    {

        for(j=1;j<=9;j++)

        {

            if(i*j==n)

            {

                cout<<"Yes"<<endl;

                return 0;

            }

        }

    }

    cout<<"No"<<endl;

    return 0;

}


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



int main(){

	int n;

	scanf("%d", &n);

	

	for(int i = 1; i < 10; i++){

		int flag = 0;

		for(int j = 1; j < 10; j++){

			if(i * j == n){

				flag = 1;

			}

		}

		

		if(flag == 1){

			printf("Yes");

			break;

		}

		else if(i == 9 && flag == 0){

			printf("No");

		}

	}

	

	return 0;

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

using namespace std;



int main()

{

    int n, chk = 0;

    cin >> n;

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

        for(int j = 0; j < 10; j++){

            if(i*j == n){

                chk = 1;

            }

        }

    }

    if(chk == 1)

        cout << "Yes";

    else

        cout << "No";



    return 0;

}


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



int main(){

	int n;

	scanf("%d", &n);

	

	for(int i = 1; i < 10; i++){

		int flag = 0;

		for(int j = 1; j < 10; j++){

			if(i * j == n){

				flag = 1;

			}

		}

		

		if(flag == 1){

			printf("Yes");

			break;

		}

		else if(i == 9 && flag == 0){

			printf("No");

		}

	}

	

	return 0;

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

#define ll long long

using namespace std;

int main()

{

    int n,f = 0;

    cin>>n;

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

    {

        if(n % i == 0)

        {

            int d = n/i;

            if(i < 10 && d < 10){f = 1; break;}

        }

    }

    if(f)cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

}


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



int main(){

	int n;

	scanf("%d", &n);

	

	for(int i = 1; i < 10; i++){

		int flag = 0;

		for(int j = 1; j < 10; j++){

			if(i * j == n){

				flag = 1;

			}

		}

		

		if(flag == 1){

			printf("Yes");

			break;

		}

		else if(i == 9 && flag == 0){

			printf("No");

		}

	}

	

	return 0;

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

using namespace std;



int main() {

	int n;

		int count=0;

	cin>>n;

	if(n>81){

	    cout<<"No"<<endl;

	}

	else if(n<1){

	    cout<<"No"<<endl;

	}



	else {

	    for(int i=1;i<=9;i++){

	        if(n%i==0){

	            if(n/i<=9&n/i>=1){

	                cout<<"Yes";

	                count=1;

	                break;

	            }

	        }

	       }

	       if(count==0)

	       cout<<"No";

	    

	}

	return 0;

}

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



int main(){

	int n;

	scanf("%d", &n);

	

	for(int i = 1; i < 10; i++){

		int flag = 0;

		for(int j = 1; j < 10; j++){

			if(i * j == n){

				flag = 1;

			}

		}

		

		if(flag == 1){

			printf("Yes");

			break;

		}

		else if(i == 9 && flag == 0){

			printf("No");

		}

	}

	

	return 0;

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

using namespace std;

int main(){

    int i = 1,x;

    while(true){

        cin >> x;

        if(x == 0) break;

        cout << "Case " << i << ": " << x <<endl;

        i++;

    }

    return 0;

}

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

#define MAX 10000



int main(){

    

    int x;

    

    for(int i = 1;i < MAX + 1;i++){

        scanf("%d",&x);

        if(x==0)

            break;

        printf("Case %d: %d\n",i,x);

    }

    return 0;

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

using namespace std;



int main()

{

    int x, i = 1;



    while (cin >> x) {

        if (x == 0)

            break;

        cout << "Case " << i++ << ": " << x << endl;

    }



    return 0;

}

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

#include <utility>

using namespace std;



#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}

#ifdef __linux

_gp(_unlocked);

#else

_gp();

#endif

#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept

#define _T template <typename T>

#define _HT template <typename H,typename... T>

#define _OP(t) inline operator t()

struct _in {

#ifdef _GLIBCXX_STRING

	_OP(string){string s;for(char c;c=gcu(),c!=' '&&c!='\n';)s+=c;return s;}

#endif

	_OP(char){char c=gcu();gcu();return c;}

	_OP(double){double d; scanf("%lf",&d); gcu();return d;}

	_T _OP(T){T n{},m{1},c;if((c=gcu())=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}

} in;

#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)

_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:ungetc(c,stdin),o=in,true;}

_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}

#define _OUT(...) _DEF(void,out,__VA_ARGS__)

#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)

_OUT(bool b){pcu('0'+b);} _OUT(const char *s){while(*s)pcu(*s++);} _OUT(char c){pcu(c);}

#ifdef _GLIBCXX_STRING

_OUT(string s){for(char c:s)pcu(c);}

#endif

_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;

	if(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}

_OUTL(){out('\n');}

#ifdef _GLIBCXX_VECTOR

_T _OUT(vector<T> v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);}

#endif

_HT _OUT(H&& h, T&&... t){out(h);out(move(t)...);}

template <typename... T> _OUTL(T&&... t){out(move(t)...);outl();}

struct range{

	int e,b=0,s=1; range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}

	struct it { int v, s; it (int _v, int _s) : v(_v), s(_s) {} operator int()const{return v;} operator int&(){return v;} int operator*()const{return v;}

		it& operator++(){v+=s;return *this;} }; it begin() {return {b, s};} it end() {return {e, s};}};



int main() {

	for (int n, i {1}; (n = in); i++)

		outl("Case ", i, ": ", n);

}