uva 1326

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <cstring>
using namespace std;
const int maxn = 25;
int n;
map<int, int> tab;
int A[maxn];
char s[1024];

int bitcount(int x) { return x == 0 ? 0 : bitcount(x / 2) + (x & 1); }  //求一个数的二进制里面有几个1

int main() {
    while(scanf("%d", &n) != EOF) {
        memset(A, 0, sizeof(A));
        for(int i = 0; i < n; ++i) {
            scanf("%s", s);
            for(int j = 0; j < strlen(s); ++j) A[i] ^= (1 << (s[j] - 'A'));
        }
        tab.clear();
        int n1 = n / 2, n2 = n - n1;
        for(int i = 0; i < (1 << n1); ++i) {
            int x = 0;
            for(int j = 0; j < n1; ++j)
                if(i & (1 << j)) x ^= A[j];
            if(!tab.count(x) || bitcount(tab[x]) < bitcount(i)) tab[x] = i;
        }
        int ans = 0;
        for(int i = 0; i < (1 << n2); ++i) {
            int x = 0;
            for(int j = 0; j < n2; ++j) if(i & (1 << j)) x ^= A[n1+j];
            if(tab.count(x) && bitcount(ans) < bitcount(tab[x]) + bitcount(i))
                ans = (i << n1) ^ tab[x];
        }
        bool ok = true;
        printf("%d\n", bitcount(ans));
        for(int i = 0; i < n; ++i)
            if((ans & (1 << i)) && ok) { printf("%d", i + 1); ok = false; }
            else if((ans & (1 << i)) && !ok) printf(" %d", i + 1);
        printf("\n");
    }
    return 0;
}