import java.util.*;
public class PrimeFinder {
public static void main(String args) {
System.out.println(primeFinder(13));
}
public static ArrayList primeFinder(int n) {
// Write your code here
ArrayList primeNo = new ArrayList<>();
for(int i = 2; i<=n; i++){
int flag = 0;
for(int j = 2; j<i; j++){
if(i%j==0){
flag++;
break;
}else{
flag = 0;
}
}
if(flag==0){
primeNo.add(i);
}
}
return primeNo;
}
}