Description：

Solution：

Code：

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstdio>

#include<cmath>

#include<cstring>

using namespace std;

#define MAXL 100010

char str[MAXL];

struct node

{

	int tr[26],par,maxl;

}s[MAXL << 1];

int last = 1,root = 1,ptr = 1;

int newnode(int k){++ptr;s[ptr].maxl = k;return ptr;}

void extend(int k)

{

	int p = last;

	int np = newnode(s[p].maxl + 1);

	for(;p && s[p].tr[k] == 0;p = s[p].par)s[p].tr[k] = np;

	if(p == 0)s[np].par = root;

	else

	{

		int q = s[p].tr[k];

		if(s[p].maxl + 1 == s[q].maxl)s[np].par = q;

		else

		{

			int nq = newnode(s[p].maxl + 1);

			memcpy(s[nq].tr,s[q].tr,sizeof(s[q].tr));

			s[nq].par = s[q].par;

			s[q].par = s[np].par = nq;

			for(;p && s[p].tr[k] == q;p = s[p].par)s[p].tr[k] = nq;

		}

	}

	last = np;

	return;

}

int n;

#define MAXN 100

int getpos(char c[])

{

	int p = root;

	int l = strlen(c + 1);

	for(int i = 1;i <= l;++i)

	{

		p = s[p].tr[c[i] - 'a'];

	}

	return p;

}

int c[MAXL << 1],a[MAXL << 1];

int SG[MAXL << 1];

int vis[MAXL << 1];

void getSG()

{

	memset(c,0,sizeof(c));

	memset(a,0,sizeof(a));

	int l = strlen(str + 1);

	for(int i = 1;i <= ptr;++i)c[s[i].maxl]++;

	for(int i = 1;i <= l;++i)c[i] += c[i - 1];

	for(int i = ptr;i >= 1;--i)a[c[s[i].maxl]--] = i;

	memset(SG,0,sizeof(SG));

	memset(vis,0,sizeof(vis));

	for(int i = ptr;i >= 1;--i)

	{

		int u = a[i];

		for(int k = 0;k < 26;++k)if(s[u].tr[k] != 0)vis[SG[s[u].tr[k]]] = u;

		int k;

		for(k = 0;(k <= 26 && vis[k] == u);++k);

		SG[u] = k;

	}

	return;

}

int main()

{

	while(scanf("%s",str + 1) != EOF)

	{

		memset(s,0,sizeof(s));

		last = root = ptr = 1;

		int l = strlen(str + 1);

		for(int i = 1;i <= l;++i)extend(str[i] - 'a');

		getSG();

		scanf("%d",&n);

		int nim = 0;

		for(int i = 1;i <= n;++i)

		{

			scanf("%s",str + 1);

			nim ^= SG[getpos(str)];

		}

		if(nim == 0)puts("Bob");

		else puts("Alice");

	}

	return 0;

}