题解 | #送分啦-QAQ#

代码

//#pragma GCC optimize("Ofast", "inline", "-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
#define int long long
using namespace std;
const int N=2e5+7;
const int mod=1e9+7;

//int read(){	int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=f*-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}

int n,f[N];

signed main(){
	cin>>n;
	f[0]=1;f[1]=1;f[2]=2;
	for(int i=2;i<=10000;i++){
		f[i]=f[i-1]+f[i-2];
		if(f[i]==n){
			cout<<"Sha\n";
			return 0;
		}
	} 
	cout<<"Xian\n";
	return 0;
}