/factor #include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <map>
#include <unordered_map>
using namespace std;
int main() {
/*
int PRIMES[25] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
int n, no, lp, count;
for (int no=3; no<5000; no+=2) {
n = no;
lp = 1;
count = 0;
for (int i=0; i<25; i++) {
while (!(n % PRIMES[i])) {
if (lp != PRIMES[i]) {
lp = PRIMES[i];
count++;
}
n /= PRIMES[i];
}
}
if (count == 4) {
cout << no << endl;
return 0;
}
}
*/
cout << 1155;
return 0;
}