import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Arrays; import java.util.HashMap; public class Main { public static void main(String[] args) { BufferedReader stdReader =new BufferedReader(new InputStreamReader(System.in)); try { int N = Integer.parseInt(stdReader.readLine()); boolean[] dp = new boolean[N+1]; ArrayList primeList = new ArrayList<>(); HashMap hashMap = new HashMap<>(); Arrays.fill(dp, true); dp[0] = false; dp[1] = false; for(int i=2;i*i<=N;i++){ if(dp[i]){ for(int j=2;j*i<=N;j++){ dp[i*j] = false; } } } int index = 2; while(N>1){ if(dp[index] && N % index == 0){ if(!hashMap.containsKey(index)){ hashMap.put(index, 1); primeList.add(index); }else{ hashMap.put(index, hashMap.get(index)+1); } N /= index; }else{ index++; } } int mult = 0; for(int i=0;i1) mult++; } if(primeList.size()==1){ System.out.println("Alice"); return; } if(primeList.size() % 2 == 0){ if(mult % 2 == 0){ System.out.println("Bob"); }else{ System.out.println("Alice"); } }else{ if(mult % 2 == 0){ System.out.println("Bob"); }else{ System.out.println("Alice"); } } } catch (IOException e) { e.printStackTrace(); } } }