#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main()
{
  int N;
  scanf("%d", &N);

  int sosu_max = ceil(sqrt(N)/2)+2;
  int *sosu = (int*)malloc(sizeof(int)*sosu_max);
  int sosu_n = 0;
  sosu[sosu_n] = 2;
  sosu_n++;
  sosu[sosu_n] = 3;
  sosu_n++;

  int k = sosu[sosu_n-1]+2;
  int i;
  int gousei = 0;
  int end = ceil(sqrt(N));
  while (k <= end) {
    for (i=1; i<sosu_n; i++) {
      if (k % sosu[i] == 0) {
        gousei = 1;
        break;
      }
    }
    if (gousei == 1) {
      gousei = 0;
    } else {
      sosu[sosu_n] = k;
      sosu_n++;
    }

    k+=2;
  }

  struct bunkai {
    int sosu; int sisu;
  };
  int bunkai_max = ceil(log10(N)/log10(2))+1;
  struct bunkai *bunkai
   = (struct bunkai*)malloc(sizeof(struct bunkai)*bunkai_max);
  int bunkai_n = 0;
  int data = N;
  int count;
  for (i=0; i<sosu_n; i++) {
    count = 1;
    while (1) {
      if (data % sosu[i] == 0) {
        if (count == 1) {
          bunkai[bunkai_n].sosu = sosu[i];
          bunkai[bunkai_n].sisu = 1;
          bunkai_n++;
        } else {
          bunkai[bunkai_n - 1].sisu++;
        }
        data /= sosu[i];
        if (data == 1) goto END;
      } else {
        break;
      }
      count++;
    }
  }
  if (data != 1) {
    bunkai[bunkai_n].sosu = data;
    bunkai[bunkai_n].sisu = 1;
    bunkai_n++;
  }
END:
  ;

  int ans = bunkai[0].sisu;
  for (i=1; i<bunkai_n; i++) ans ^= bunkai[i].sisu;
  if (ans == 0) {
    printf("Bob\n");
  } else {
    printf("Alice\n");
  }
  return 0;
}