//leehaoze
#include <iostream>
#include <deque>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <cstdlib>
using namespace std;
const int INF = 1<<29;
#define INC_SAT( val ) (val = ((val)+1 > (val)) ? (val)+1 : (val))
#define ARR_SIZE( a ) ( sizeof( (a) ) / sizeof( (a[0]) ) )
#define ULL unsigned long long
int data[] = {1, 64, 729, 4096, 15625, 46656, 117649, 262144, 531441,
1000000, 1771561, 2985984, 4826809, 7529536, 11390625, 16777216, 24137569, 34012224,
47045881, 64000000 , 85766121};
int main() {
long long num;
while(scanf("%lld",&num) && num){
bool flag = false;
for (int i = 0; i < 21; ++i) {
if(num == data[i]){
flag = true;
printf("Special\n");
break;
}
}
if(!flag){
printf("Ordinary\n");
}
}
return 0;
}
A Giveaway UVALive - 7633
最新推荐文章于 2024-09-09 08:03:15 发布