#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
#include<unordered_map>
#include <random>
#include<bitset>
#include<cassert>
#include<chrono>
//#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vll=vector<ll>;
using vi=vector<int>;
using vvi=vector<vi>;
using P=pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define repi(i,a,b) for(int i=(int)(a); i<(int)(b); i++)
#define all(x) (x).begin(),(x).end()
#define arr(x) (x).rbegin(),(x).rend()

template<typename T,typename S> bool chmin(T&a,const S&b){
    return a>b?a=b,1:0;
}
template<typename T,typename S> bool chmax(T&a,const S&b){
    return a<b?a=b,1:0;
}


ll pow_pow(ll x, ll n, ll mod) {
   if(n == 0) return 1;
   x %= mod;
   ll res = pow_pow(x * x % mod, n / 2, mod);
   if(n & 1) res = res * x % mod;
   return res;
}

const ll inf=4e18;
void solve(int test){
    /*
    map<vi,int> seen;
    map<vi,int> dp;
    auto f=[&](vi a,int l,int r){
        repi(i,l,r+1)a[i]^=1;
        return a;
    };
    int n=7;
    auto dfs=[&](auto dfs,vi &v)->int{
        if(seen[v]){
            return dp[v];
        }
        seen[v]=1;
        int is=0;
        rep(r,n)if(v[r]==1){
            for(int l=r; l>=0; l--){
                if(l!=r && v[l]==1)break;
                vi b=f(v,l,r);
                if(!dfs(dfs,b))is=1;
            }
        }
        dp[v]=is;
        return dp[v];
    };
    rep(bit,1<<n){
        vi vs;
        rep(i,n)vs.push_back(bit>>i&1);
        reverse(all(vs));
        rep(i,n)cout<< vs[i];
        cout << " " << dfs(dfs,vs) << endl;
    }
    */
    int n; cin >> n;
    string s; cin >> s;
    ll val=0;
    rep(i,n){
        val*=2;
        if(s[i]=='B')val++;
        val%=3;
    }
    if(val==0){
        cout << "Bob" << endl;
    }
    else {
        cout << "Alice" << endl;
    }






}
int main(){
    int t=1;// cin >> t;
    rep(test,t)solve(test);
}