#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

map<long long,long long> get(long long n){
	map<long long,long long> mp;
	for(long long i = 2; i*i <= n; i++){
		while(n%i == 0){
			mp[i]++;
			n /= i;
		}
	}
	if(n != 1) mp[n]++;
	return mp;
}

int main(){
	long long n;
	cin>>n;
	map<long long,long long> mp;
	for(long long i=2;i<=n;i++){
		map<long long,long long> tmp = get((1LL<<i)-1);
		for(auto x:tmp){
			mp[x.first] += x.second;
		}
	}
	auto m2 = get((1LL<<(n+1))-1);
	for(auto x:m2){
		if(x.second > mp[x.first]){
			cout<<"No"<<endl;
			return 0;
		}
	}
	cout<<"Yes"<<endl;
	
	
	return 0;
}