AOJ1562.cpp

#include <bits/stdc++.h>
using namespace std;

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2018/02/05  Problem: AOJ 1562 / Link: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1562  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----

頭がないので全探索ではなく法則を見つけようとしていたね…

----解説ここまで---- */

LL N;

LL ans = 0LL;

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	cin >> N;
	ans = INF;
	FOR(i,1,1<<13){
		int div = i;
		set<int>s;
		s.insert(1);
		FOR(i,2,1<<13){
			if(div%i==0){
				s.insert(i);
			}
		}
		if(s.size() == N){
			ans = min(ans,(LL)i);
		}
	}
	cout << ans << "\n";

	return 0;
}