stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
//Littleboy123 Template 1.1



#include <bits/stdc++.h>

using namespace std;



//pragmas

/*

#pragma comment(linker, "/stack:200000000")

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma GCC target ("avx2")

#pragma GCC optimization ("Ofast")

#pragma GCC optimization ("unroll-loops")

*/



typedef pair<int, int> ii;

typedef vector<int> vi;

typedef vector<ii> vii;

typedef long long int ll;

typedef unsigned long long int ull;

typedef long double ld;



#define FOR(a,b,c) for(ll (a)=(b);(a)<(c);++(a))

#define FORE(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))

#define FORN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))

#define FORNE(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))

#define COUT(a) cout << (a) << '\n'

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

#define MAX(a,b) (a) = max((a), (b))

#define MIN(a,b) (a) = min((a), (b))

#define nl '\n'

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pi acos(-1.0)



void init(){

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

}



//End of template



int main(){

	init();



	//debug

	/*

	ifstream in("input.in");

	streambuf *cinbuf = std::cin.rdbuf();

	cin.rdbuf(in.rdbuf());



	ofstream out("out.txt");

	streambuf *coutbuf = std::cout.rdbuf();

	cout.rdbuf(out.rdbuf());

	*/

	//end debug



	string s;

	cin >> s;

	cout << "2018" << s.substr(4, s.length()) << nl;

	return 0;

}

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



int main()

{

	char str[255];

	

	scanf("%s", str);

	

	str[3] = '8';

	

	printf("%s\n", str);

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

#include<string>

using namespace std;

int main()

{

    string s;

    string s2="2018";

    getline(cin,s);

    s.replace(0,4,s2);

    cout<<s<<endl;



}


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

#include <string.h>



int main(){

	char S[120];

	scanf("%s", &S);

	getchar();

	

	S[0] = '2';

	S[1] = '0';	

	S[2] = '1';

	S[3] = '8';

	

	printf("%s", S);

	return 0;

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

using  namespace std;

int main ()

{

    string a;

    cin>>a;

    a[3]='8';



    cout<<a<<endl;



}


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

#include <string.h>



int main(){

	char S[120];

	scanf("%s", &S);

	getchar();

	

	S[0] = '2';

	S[1] = '0';	

	S[2] = '1';

	S[3] = '8';

	

	printf("%s", S);

	return 0;

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

#include<iostream>

#include<cstdio>

#include<string.h>



int main()

{

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

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

    int a,b,c;

    char str[100];

    scanf("%s",str);

    int ln=strlen(str);

    printf("2018");

    for(int i=4;i<ln;i++){

        printf("%c",str[i]);

    }

    printf("\n");











    return 0;

}




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

#include <string.h>



int main(){

	char S[120];

	scanf("%s", &S);

	getchar();

	

	S[0] = '2';

	S[1] = '0';	

	S[2] = '1';

	S[3] = '8';

	

	printf("%s", S);

	return 0;

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

#define fi first

#define se second

#define pb push_back

using namespace std;

typedef long long LL;

typedef pair<int, int> pii;



int main()

{

    string S;

    cin>>S;

    S[3]='8';

    cout<<S<<endl;

    return 0;

}


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

#include <string.h>



int main(){

	char S[120];

	scanf("%s", &S);

	getchar();

	

	S[0] = '2';

	S[1] = '0';	

	S[2] = '1';

	S[3] = '8';

	

	printf("%s", S);

	return 0;

}
// Slower C++ solution:
//Littleboy123 Template 1.1



#include <bits/stdc++.h>

using namespace std;



//pragmas

/*

#pragma comment(linker, "/stack:200000000")

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma GCC target ("avx2")

#pragma GCC optimization ("Ofast")

#pragma GCC optimization ("unroll-loops")

*/



typedef pair<int, int> ii;

typedef vector<int> vi;

typedef vector<ii> vii;

typedef long long int ll;

typedef unsigned long long int ull;

typedef long double ld;



#define FOR(a,b,c) for(ll (a)=(b);(a)<(c);++(a))

#define FORE(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))

#define FORN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))

#define FORNE(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))

#define COUT(a) cout << (a) << '\n'

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

#define MAX(a,b) (a) = max((a), (b))

#define MIN(a,b) (a) = min((a), (b))

#define nl '\n'

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pi acos(-1.0)



void init(){

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

}



//End of template



int main(){

	init();



	//debug

	/*

	ifstream in("input.in");

	streambuf *cinbuf = std::cin.rdbuf();

	cin.rdbuf(in.rdbuf());



	ofstream out("out.txt");

	streambuf *coutbuf = std::cout.rdbuf();

	cout.rdbuf(out.rdbuf());

	*/

	//end debug



	string s;

	cin >> s;

	cout << "2018" << s.substr(4, s.length()) << nl;

	return 0;

}

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

#include <string.h>



int main(){

	char S[120];

	scanf("%s", &S);

	getchar();

	

	S[0] = '2';

	S[1] = '0';	

	S[2] = '1';

	S[3] = '8';

	

	printf("%s", S);

	return 0;

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

#include<string>

using namespace std;

int main()

{

    string s;

    string s2="2018";

    getline(cin,s);

    s.replace(0,4,s2);

    cout<<s<<endl;



}


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

 

int main()

{

	char input[101];

	scanf("%s", input);

	input[3] = '8';

	printf("%s", input);

	return 0;

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

using  namespace std;

int main ()

{

    string a;

    cin>>a;

    a[3]='8';



    cout<<a<<endl;



}


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

 

int main()

{

	char input[101];

	scanf("%s", input);

	input[3] = '8';

	printf("%s", input);

	return 0;

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

#include<iostream>

#include<cstdio>

#include<string.h>



int main()

{

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

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

    int a,b,c;

    char str[100];

    scanf("%s",str);

    int ln=strlen(str);

    printf("2018");

    for(int i=4;i<ln;i++){

        printf("%c",str[i]);

    }

    printf("\n");











    return 0;

}




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

 

int main()

{

	char input[101];

	scanf("%s", input);

	input[3] = '8';

	printf("%s", input);

	return 0;

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

#define fi first

#define se second

#define pb push_back

using namespace std;

typedef long long LL;

typedef pair<int, int> pii;



int main()

{

    string S;

    cin>>S;

    S[3]='8';

    cout<<S<<endl;

    return 0;

}


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

 

int main()

{

	char input[101];

	scanf("%s", input);

	input[3] = '8';

	printf("%s", input);

	return 0;

}
// Slower C++ solution:
//Littleboy123 Template 1.1



#include <bits/stdc++.h>

using namespace std;



//pragmas

/*

#pragma comment(linker, "/stack:200000000")

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma GCC target ("avx2")

#pragma GCC optimization ("Ofast")

#pragma GCC optimization ("unroll-loops")

*/



typedef pair<int, int> ii;

typedef vector<int> vi;

typedef vector<ii> vii;

typedef long long int ll;

typedef unsigned long long int ull;

typedef long double ld;



#define FOR(a,b,c) for(ll (a)=(b);(a)<(c);++(a))

#define FORE(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))

#define FORN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))

#define FORNE(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))

#define COUT(a) cout << (a) << '\n'

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

#define MAX(a,b) (a) = max((a), (b))

#define MIN(a,b) (a) = min((a), (b))

#define nl '\n'

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pi acos(-1.0)



void init(){

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

}



//End of template



int main(){

	init();



	//debug

	/*

	ifstream in("input.in");

	streambuf *cinbuf = std::cin.rdbuf();

	cin.rdbuf(in.rdbuf());



	ofstream out("out.txt");

	streambuf *coutbuf = std::cout.rdbuf();

	cout.rdbuf(out.rdbuf());

	*/

	//end debug



	string s;

	cin >> s;

	cout << "2018" << s.substr(4, s.length()) << nl;

	return 0;

}

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

 

int main()

{

	char input[101];

	scanf("%s", input);

	input[3] = '8';

	printf("%s", input);

	return 0;

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

#include<string>

using namespace std;

int main()

{

    string s;

    string s2="2018";

    getline(cin,s);

    s.replace(0,4,s2);

    cout<<s<<endl;



}


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



int main() {

	char tgl[10]; 

	scanf("%s", &tgl);

	tgl[3] = '8';

	printf("%s", tgl); 

	return 0;

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

using  namespace std;

int main ()

{

    string a;

    cin>>a;

    a[3]='8';



    cout<<a<<endl;



}


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



int main() {

	char tgl[10]; 

	scanf("%s", &tgl);

	tgl[3] = '8';

	printf("%s", tgl); 

	return 0;

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

#include<iostream>

#include<cstdio>

#include<string.h>



int main()

{

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

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

    int a,b,c;

    char str[100];

    scanf("%s",str);

    int ln=strlen(str);

    printf("2018");

    for(int i=4;i<ln;i++){

        printf("%c",str[i]);

    }

    printf("\n");











    return 0;

}




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



int main() {

	char tgl[10]; 

	scanf("%s", &tgl);

	tgl[3] = '8';

	printf("%s", tgl); 

	return 0;

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

#define fi first

#define se second

#define pb push_back

using namespace std;

typedef long long LL;

typedef pair<int, int> pii;



int main()

{

    string S;

    cin>>S;

    S[3]='8';

    cout<<S<<endl;

    return 0;

}


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



int main() {

	char tgl[10]; 

	scanf("%s", &tgl);

	tgl[3] = '8';

	printf("%s", tgl); 

	return 0;

}
// Slower C++ solution:
//Littleboy123 Template 1.1



#include <bits/stdc++.h>

using namespace std;



//pragmas

/*

#pragma comment(linker, "/stack:200000000")

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma GCC target ("avx2")

#pragma GCC optimization ("Ofast")

#pragma GCC optimization ("unroll-loops")

*/



typedef pair<int, int> ii;

typedef vector<int> vi;

typedef vector<ii> vii;

typedef long long int ll;

typedef unsigned long long int ull;

typedef long double ld;



#define FOR(a,b,c) for(ll (a)=(b);(a)<(c);++(a))

#define FORE(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))

#define FORN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))

#define FORNE(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))

#define COUT(a) cout << (a) << '\n'

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

#define MAX(a,b) (a) = max((a), (b))

#define MIN(a,b) (a) = min((a), (b))

#define nl '\n'

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pi acos(-1.0)



void init(){

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

}



//End of template



int main(){

	init();



	//debug

	/*

	ifstream in("input.in");

	streambuf *cinbuf = std::cin.rdbuf();

	cin.rdbuf(in.rdbuf());



	ofstream out("out.txt");

	streambuf *coutbuf = std::cout.rdbuf();

	cout.rdbuf(out.rdbuf());

	*/

	//end debug



	string s;

	cin >> s;

	cout << "2018" << s.substr(4, s.length()) << nl;

	return 0;

}

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



int main() {

	char tgl[10]; 

	scanf("%s", &tgl);

	tgl[3] = '8';

	printf("%s", tgl); 

	return 0;

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

#include<string>

using namespace std;

int main()

{

    string s;

    string s2="2018";

    getline(cin,s);

    s.replace(0,4,s2);

    cout<<s<<endl;



}


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

int main(){

	char angka[100];

	scanf("%[^\n]" , angka);

	angka[3] = '8';

	printf("%s" , angka);

	

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

using  namespace std;

int main ()

{

    string a;

    cin>>a;

    a[3]='8';



    cout<<a<<endl;



}


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

int main(){

	char angka[100];

	scanf("%[^\n]" , angka);

	angka[3] = '8';

	printf("%s" , angka);

	

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

#include<iostream>

#include<cstdio>

#include<string.h>



int main()

{

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

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

    int a,b,c;

    char str[100];

    scanf("%s",str);

    int ln=strlen(str);

    printf("2018");

    for(int i=4;i<ln;i++){

        printf("%c",str[i]);

    }

    printf("\n");











    return 0;

}




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

int main(){

	char angka[100];

	scanf("%[^\n]" , angka);

	angka[3] = '8';

	printf("%s" , angka);

	

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

#define fi first

#define se second

#define pb push_back

using namespace std;

typedef long long LL;

typedef pair<int, int> pii;



int main()

{

    string S;

    cin>>S;

    S[3]='8';

    cout<<S<<endl;

    return 0;

}


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

int main(){

	char angka[100];

	scanf("%[^\n]" , angka);

	angka[3] = '8';

	printf("%s" , angka);

	

}
// Slower C++ solution:
//Littleboy123 Template 1.1



#include <bits/stdc++.h>

using namespace std;



//pragmas

/*

#pragma comment(linker, "/stack:200000000")

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma GCC target ("avx2")

#pragma GCC optimization ("Ofast")

#pragma GCC optimization ("unroll-loops")

*/



typedef pair<int, int> ii;

typedef vector<int> vi;

typedef vector<ii> vii;

typedef long long int ll;

typedef unsigned long long int ull;

typedef long double ld;



#define FOR(a,b,c) for(ll (a)=(b);(a)<(c);++(a))

#define FORE(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))

#define FORN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))

#define FORNE(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))

#define COUT(a) cout << (a) << '\n'

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

#define MAX(a,b) (a) = max((a), (b))

#define MIN(a,b) (a) = min((a), (b))

#define nl '\n'

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pi acos(-1.0)



void init(){

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

}



//End of template



int main(){

	init();



	//debug

	/*

	ifstream in("input.in");

	streambuf *cinbuf = std::cin.rdbuf();

	cin.rdbuf(in.rdbuf());



	ofstream out("out.txt");

	streambuf *coutbuf = std::cout.rdbuf();

	cout.rdbuf(out.rdbuf());

	*/

	//end debug



	string s;

	cin >> s;

	cout << "2018" << s.substr(4, s.length()) << nl;

	return 0;

}

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

int main(){

	char angka[100];

	scanf("%[^\n]" , angka);

	angka[3] = '8';

	printf("%s" , angka);

	

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

#include<string>

using namespace std;

int main()

{

    string s;

    string s2="2018";

    getline(cin,s);

    s.replace(0,4,s2);

    cout<<s<<endl;



}


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



int main () {

    char tahun[12];

    scanf("%s", tahun) ;



    tahun [0] = '2' ;

    tahun [1] = '0' ;

    tahun [2] = '1' ;

    tahun [3] = '8' ;

    printf("%s", tahun) ; 

    return 0 ; 

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

using  namespace std;

int main ()

{

    string a;

    cin>>a;

    a[3]='8';



    cout<<a<<endl;



}


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



int main () {

    char tahun[12];

    scanf("%s", tahun) ;



    tahun [0] = '2' ;

    tahun [1] = '0' ;

    tahun [2] = '1' ;

    tahun [3] = '8' ;

    printf("%s", tahun) ; 

    return 0 ; 

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

#include<iostream>

#include<cstdio>

#include<string.h>



int main()

{

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

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

    int a,b,c;

    char str[100];

    scanf("%s",str);

    int ln=strlen(str);

    printf("2018");

    for(int i=4;i<ln;i++){

        printf("%c",str[i]);

    }

    printf("\n");











    return 0;

}




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



int main () {

    char tahun[12];

    scanf("%s", tahun) ;



    tahun [0] = '2' ;

    tahun [1] = '0' ;

    tahun [2] = '1' ;

    tahun [3] = '8' ;

    printf("%s", tahun) ; 

    return 0 ; 

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

#define fi first

#define se second

#define pb push_back

using namespace std;

typedef long long LL;

typedef pair<int, int> pii;



int main()

{

    string S;

    cin>>S;

    S[3]='8';

    cout<<S<<endl;

    return 0;

}


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



int main () {

    char tahun[12];

    scanf("%s", tahun) ;



    tahun [0] = '2' ;

    tahun [1] = '0' ;

    tahun [2] = '1' ;

    tahun [3] = '8' ;

    printf("%s", tahun) ; 

    return 0 ; 

}
// Slower C++ solution:
//Littleboy123 Template 1.1



#include <bits/stdc++.h>

using namespace std;



//pragmas

/*

#pragma comment(linker, "/stack:200000000")

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma GCC target ("avx2")

#pragma GCC optimization ("Ofast")

#pragma GCC optimization ("unroll-loops")

*/



typedef pair<int, int> ii;

typedef vector<int> vi;

typedef vector<ii> vii;

typedef long long int ll;

typedef unsigned long long int ull;

typedef long double ld;



#define FOR(a,b,c) for(ll (a)=(b);(a)<(c);++(a))

#define FORE(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))

#define FORN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))

#define FORNE(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))

#define COUT(a) cout << (a) << '\n'

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

#define MAX(a,b) (a) = max((a), (b))

#define MIN(a,b) (a) = min((a), (b))

#define nl '\n'

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pi acos(-1.0)



void init(){

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

}



//End of template



int main(){

	init();



	//debug

	/*

	ifstream in("input.in");

	streambuf *cinbuf = std::cin.rdbuf();

	cin.rdbuf(in.rdbuf());



	ofstream out("out.txt");

	streambuf *coutbuf = std::cout.rdbuf();

	cout.rdbuf(out.rdbuf());

	*/

	//end debug



	string s;

	cin >> s;

	cout << "2018" << s.substr(4, s.length()) << nl;

	return 0;

}

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



int main () {

    char tahun[12];

    scanf("%s", tahun) ;



    tahun [0] = '2' ;

    tahun [1] = '0' ;

    tahun [2] = '1' ;

    tahun [3] = '8' ;

    printf("%s", tahun) ; 

    return 0 ; 

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

#include<string>

using namespace std;

int main()

{

    string s;

    string s2="2018";

    getline(cin,s);

    s.replace(0,4,s2);

    cout<<s<<endl;



}


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

int main(){

	char tanggal[15];

	scanf("%s", &tanggal);

	tanggal[3] = '8';

	printf ("%s", tanggal);

	

	return 0;

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

using  namespace std;

int main ()

{

    string a;

    cin>>a;

    a[3]='8';



    cout<<a<<endl;



}


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

int main(){

	char tanggal[15];

	scanf("%s", &tanggal);

	tanggal[3] = '8';

	printf ("%s", tanggal);

	

	return 0;

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

#include<iostream>

#include<cstdio>

#include<string.h>



int main()

{

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

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

    int a,b,c;

    char str[100];

    scanf("%s",str);

    int ln=strlen(str);

    printf("2018");

    for(int i=4;i<ln;i++){

        printf("%c",str[i]);

    }

    printf("\n");











    return 0;

}




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

int main(){

	char tanggal[15];

	scanf("%s", &tanggal);

	tanggal[3] = '8';

	printf ("%s", tanggal);

	

	return 0;

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

#define fi first

#define se second

#define pb push_back

using namespace std;

typedef long long LL;

typedef pair<int, int> pii;



int main()

{

    string S;

    cin>>S;

    S[3]='8';

    cout<<S<<endl;

    return 0;

}


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

int main(){

	char tanggal[15];

	scanf("%s", &tanggal);

	tanggal[3] = '8';

	printf ("%s", tanggal);

	

	return 0;

}
// Slower C++ solution:
//Littleboy123 Template 1.1



#include <bits/stdc++.h>

using namespace std;



//pragmas

/*

#pragma comment(linker, "/stack:200000000")

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma GCC target ("avx2")

#pragma GCC optimization ("Ofast")

#pragma GCC optimization ("unroll-loops")

*/



typedef pair<int, int> ii;

typedef vector<int> vi;

typedef vector<ii> vii;

typedef long long int ll;

typedef unsigned long long int ull;

typedef long double ld;



#define FOR(a,b,c) for(ll (a)=(b);(a)<(c);++(a))

#define FORE(a,b,c) for(ll (a)=(b);(a)<=(c);++(a))

#define FORN(a,b,c) for(ll (a)=(b);(a)>(c);--(a))

#define FORNE(a,b,c) for(ll (a)=(b);(a)>=(c);--(a))

#define COUT(a) cout << (a) << '\n'

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

#define MAX(a,b) (a) = max((a), (b))

#define MIN(a,b) (a) = min((a), (b))

#define nl '\n'

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pi acos(-1.0)



void init(){

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

}



//End of template



int main(){

	init();



	//debug

	/*

	ifstream in("input.in");

	streambuf *cinbuf = std::cin.rdbuf();

	cin.rdbuf(in.rdbuf());



	ofstream out("out.txt");

	streambuf *coutbuf = std::cout.rdbuf();

	cout.rdbuf(out.rdbuf());

	*/

	//end debug



	string s;

	cin >> s;

	cout << "2018" << s.substr(4, s.length()) << nl;

	return 0;

}

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

int main(){

	char tanggal[15];

	scanf("%s", &tanggal);

	tanggal[3] = '8';

	printf ("%s", tanggal);

	

	return 0;

}