2060.cpp

2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
    long int n;
    while(scanf("%d",&n)!=EOF)
    {
       /* cin>>n; */
        if((n+2)%4==0){cout<<"yes"<<endl; }
        else cout<<"no"<<endl;
    };
}