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

using namespace std;

char str[100010];

int main() {

	scanf("%s",&str);

	int len=strlen(str);

	if(len%2!=0) {

		printf("No");

		return 0;

	}

	for(int i=0; i<len/2; i++) {

		int r=abs(str[i]-str[len-i-1]);

		if(r!=1&&r!=2) { 

			printf("No");

			return 0;

		}

	}

	printf("Yes");

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

#include<iostream>

#include<cstring>

#include<stack>

using namespace std;

stack<char>s;

string a;

int main(){

	cin>>a;

	int n=a.size();

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

		s.push(a[i]);

	}

	long long ans=1;

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

		char top=s.top();

		if(top=='b')

			top='d';

		else

			if(top=='d')

				top='b';

		else

			if(top=='p')

				top='q';

		else

			if(top=='q')

				top='p';

		if(top==a[i]){

			ans=1;

			s.pop();

		}

		else{

			ans=0;

			break;

		}

	}

	if(ans==0)

		printf("No");

	else

		printf("Yes");

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

string s;

int main(){

    cin>>s;

    int c=s.size();

    if(c%2!=0){

        printf("No");

        return 0;

    }

    for(int i=0;i<c/2;i++){

        short t=abs(s[i]-s[c-i-1]);

        if(t!=1&&t!=2){ 

            printf("No\n"); 

            return 0;

        }

    }

    printf("Yes\n"); 

    return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

string s;

int main(){

    cin>>s;

    int c=s.size();

    if(c%2!=0){

        printf("No");

        return 0;

    }

    for(int i=0;i<c/2;i++){

        short t=abs(s[i]-s[c-i-1]);

        if(t!=1&&t!=2){ 

            printf("No\n"); 

            return 0;

        }

    }

    printf("Yes\n"); 

    return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

char a[100005],b[100005];

int main()

{

	cin>>a;

	for(int i=0;i<strlen(a);i++){

		b[i]=a[strlen(a)-i-1];

		if(b[i]=='b')

		b[i]='d';

		else if(b[i]=='d')

		b[i]='b';

		else if(b[i]=='p')

		b[i]='q';

		else if(b[i]=='q')

		b[i]='p';

		if(b[i]!=a[i]){

			cout<<"No";

			return 0;

		}

	}

	cout<<"Yes";

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

#include<iomanip>

#include<cmath>

#include<cstring>

#include<cstdio>

#include<queue>

#include<algorithm>

using namespace std;

char s[100005];

int ma[205];

int main()

{

	scanf("%s",s);

	int len=strlen(s);

	ma['p']=1,ma['q']=4,ma['b']=2,ma['d']=3;

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

	{

		if(ma[s[i]]+ma[s[len-i-1]]!=5)

		{

			printf("No");

			return 0;

		}

	}

	printf("Yes");

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

#include<iostream>

#include<cstring>

#include<stack>

using namespace std;

stack<char>s;

string a;

int main(){

    cin>>a;

    int n=a.size();

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

        s.push(a[i]);

    }

    bool ju=1;

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

        char top=s.top();

        if(top=='b') top='d';

        else if(top=='d') top='b';

        else if(top=='p') top='q';

        else if(top=='q') top='p';

        if(top==a[i]) {

            ju=1;

            s.pop();

        }

        else {

            ju=0;

            break;

        }

    }

    if(ju==0) printf("No");

    else printf("Yes");

    return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

string s;

int main()

{

	int l,i,j;

	cin>>s;

	l=s.size();

	if(l%2)

	{

		cout<<"No";

		return 0;

	}

	for(i=0,j=l-1;i<j;i++,j--)

	{

		if(s[i]=='b'&&s[j]!='d')

		{

			cout<<"No";

			return 0;

		}

		else

		{

			if(s[i]=='d'&&s[j]!='b')

			{

				cout<<"No";

				return 0;

			}

			else

			{

				if(s[i]=='p'&&s[j]!='q')

				{

					cout<<"No";

					return 0;

				}

				else

				{

					if(s[i]=='q'&&s[j]!='p')

					{

						cout<<"No";

						return 0;

					}

				}

			}

		}

	}

	cout<<"Yes";

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

#include<cstdio>

#include<algorithm>

#define reg register

#define ios ios::sync_with_stdio(false)

using namespace std;

int t[101],p[101];

int main() 

{

	ios;string s1,s2;cin>>s1;s2=s1;

	reverse(s2.begin(),s2.end());//交换函数abc->cba //orz%%%dalao

	int l=s2.length();

	for(reg int i=0;i<=l-1;i++)

	{

		if(s2[i]=='b'){s2[i]='d';continue;}

		if(s2[i]=='d'){s2[i]='b';continue;}

		if(s2[i]=='p'){s2[i]='q';continue;}

		if(s2[i]=='q'){s2[i]='p';continue;}

	}

	if(s1==s2)puts("Yes");

	else	puts("No");

    return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

char s[200000];

int get[128];

int main()

{

    get['b'] = 0;

	get['p'] = 1;

	get['d'] = 2;

	get['q'] = 3;

    scanf("%s",s+1);

    for(int l=strlen(s+1),i=1;i<=(l>>1)+1;++i)

    {

        if(get[s[i]]^((get[s[l-i+1]]+2)%4))

		{

		return printf("No\n"),0;	

		 } 

    } 

    return printf("Yes\n"),0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

bool ismirror(string s)

{

	string ss;

	int len = s.size();

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

	{

		ss += ' ';

	}

	int h = 0;

	for(int i = len-1;i >= 0;i--)

	{

		ss[h++] = s[i];

	}

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

	{

		if(ss[i] == 'b')

		{

			ss[i] = 'd';

			continue;

		}else if(ss[i] == 'd')

		{

			ss[i] = 'b';

			continue;

		}else if(ss[i] == 'p')

		{

			ss[i] ='q';

			continue;

		}else if(ss[i] == 'q')

		{

			ss[i] = 'p';

			continue;

		}

	}

	if(ss == s)

	{

		return true;

	}else

	{

		return false;

	}

}

int main()

{

	string s;

	cin>>s;

	if(ismirror(s))

	{

		cout<<"Yes";

	}else cout<<"No";

	return 0;

	

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

int main()

{

    string a;

    cin>>a;

    string b=a;

    reverse(a.begin(),a.end());

    for(int i=0;i<a.size();++i)

    {

        if(a[i]=='b') a[i]='d';

        else if(a[i]=='d') a[i]='b';

        else if(a[i]=='p') a[i]='q';

        else if(a[i]=='q') a[i]='p';

    }

    if(a==b) cout<<"Yes";

    else cout<<"No";

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>//'三玖是天！ '.

using namespace std;

int main()

{

	string s,ss;

	cin>>s;

	ss=s;

	reverse(s.begin(),s.end());

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

	{

		if(s[i]=='b')s[i]='d';

		else if(s[i]=='d')s[i]='b';

		else if(s[i]=='p')s[i]='q';

		else s[i]='p';

	}

	if(ss==s)cout<<"Yes"<<endl;

	else cout<<"No"<<endl;

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

#include<string>

using namespace std;

char f[256];

int main()

{

	 string s,a;

	 f['b']='d';

	 f['d']='b';

	 f['p']='q';

	 f['q']='p';

	 cin>>s;

	 for(int i=s.length()-1;i>=0;i--)

		 a=a+s[i];

	 //cout<<a<<endl;

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

		 a[i]=f[a[i]];

	 if(a==s) cout<<"Yes";

		   else cout<<"No";

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

#include<cstdio>

#include<cmath>

#include<algorithm>

#include<cstring>

#include<string>

using namespace std;

int i,n,j,k,m,l,o,p;

string s,a;

int main()

{

	cin>>s;

	a=s;

	for(i=0,j=a.length()-1;i<=j;i++,j--)

	{

	swap(a[i],a[j]);

	}

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

	{

	if(a[i]=='d') a[i]='b';

		else if(a[i]=='b') a[i]='d';

			else if(a[i]=='p') a[i]='q';

				else if(a[i]=='q') a[i]='p';

	}

	if(a==s) cout<<"Yes";

		else cout<<"No";

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

#include<string>

using namespace std;

int main()

{

	string s;

	cin>>s;

	int cc=s.length();

	for(int i=0;i<=cc/2;i++)

	{

		if(s[i]=='b'){if(s[cc-i-1]!='d'){cout<<"No";return 0;}}

		if(s[i]=='d'){if(s[cc-i-1]!='b'){cout<<"No";return 0;}}

		if(s[i]=='p'){if(s[cc-i-1]!='q'){cout<<"No";return 0;}}

		if(s[i]=='q'){if(s[cc-i-1]!='p'){cout<<"No";return 0;}}

	}

	cout<<"Yes";

	return 0;

}


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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

char a[100010],b[100010];

int main(void){

	scanf("%s",a+1);

	int cnt=0;

	for(int i=strlen(a+1);i>=1;i--){

		b[++cnt]=a[i];

	}

	for(int i=1;i<=strlen(a+1);i++){

		if(a[i]=='b') a[i]='d';

		else if(a[i]=='d') a[i]='b';

		else if(a[i]=='p') a[i]='q';

		else if(a[i]=='q') a[i]='p';

		if(a[i]==b[i]) continue;

		else{

			printf("No\n");

			return 0;

		}

	}

	printf("Yes\n");

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

string s,t;

int len;

int main()

{

    cin>>s;

    t=s;

    reverse(s.begin(),s.end());

    len=s.length();

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

    {

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

		    s[i]='d';

        else if(s[i]=='d')

		    s[i]='b';

        else if(s[i]=='p')

		    s[i]='q';

        else if(s[i]=='q')

		    s[i]='p';

    }

    if(s==t)

	    printf("Yes");

    else

	    printf("No");

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

string a,b;

int main()

{

    cin>>a;

    b=a;

    for(int i=0;i<a.size()/2;++i)swap(a[a.size()-1-i],a[i]);

    for(int i=0;i<a.size();++i)

    {

        if(a[i]=='b')a[i]='d';

        else if(a[i]=='d')a[i]='b';

        else if(a[i]=='p')a[i]='q';

        else if(a[i]=='q')a[i]='p';

    }

    if(a==b) cout<<"Yes";

    else cout<<"No";

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

string s,ss;

int main()

{

    getline(cin,s);

    ss=s;

	reverse(ss.begin(),ss.end());

    for(int i=0;i<ss.size();i++)

        switch(ss[i])

		{

            case 'b':ss[i]='d';break;

            case 'd':ss[i]='b';break;

            case 'p':ss[i]='q';break;

            case 'q':ss[i]='p';break;

        }

    s==ss?printf("Yes\n"):printf("No\n");

    return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

#include<cstdio>

#include<algorithm>

#include<cstring>

#include<vector>

#include<cmath>

#include<map>

using namespace std;

typedef long long ll;

string a,b;

int main()

{

    cin>>a;

    for(int i=a.size()-1;i>=0;i--){

        if(a[i]=='p') b+='q';

        else if(a[i]=='q') b+='p';

        else if(a[i]=='b') b+='d';

        else b+='b';

    }

    if(a==b) printf("Yes");

    else printf("No");

    return 0;

}


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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

char a[100005],b[100005];

int main()

{

	cin>>a;

	

	int len=strlen(a);

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

	{

		int loc=len-i-1;

		b[loc]=a[i];

		if(b[loc]=='p') b[loc]='q';

		else if(b[loc]=='q') b[loc]='p';

		else if(b[loc]=='b') b[loc]='d';

		else if(b[loc]=='d') b[loc]='b';

	}

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

	if(a[i]!=b[i]) {cout<<"No"<<endl; goto u;}

	cout<<"Yes"<<endl;

	u: ;

	return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

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

using namespace std;

int main()

{

    string a;

    cin>>a;

    string b=a;

    reverse(b.begin(),b.end());

    for(int i=0;i<b.size();i++)

    {

        if(b[i]=='d')

            b[i]='b';

        else if(b[i]=='b')

            b[i]='d';

        if(b[i]=='p')

            b[i]='q';

        else if(b[i]=='q')

            b[i]='p';

    }

    if(a==b)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;

    return 0;

}

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

#include <cstring>

#include <algorithm>

using namespace std;

char s[100001],ss[100001];

int main(){

	scanf("%s",s);

	memcpy(ss,s,sizeof(s));

	int n=strlen(s);

	reverse(s,s+n);

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

		switch(s[i]){

			case 'd':

				s[i]='b';

				break;

			case 'b':

				s[i]='d';

				break;

			case 'p':

				s[i]='q';

				break;

			case 'q':

				s[i]='p';

				break;

		}

	puts(strcmp(ss,s)?"No":"Yes");

	return 0;

}