Today is birthday of a Little Dasha — she is now 8 years old! On this occasion, each of her n friends and relatives gave her a ribbon with a greeting written on it, and, as it turned out, all the greetings are different. Dasha gathered all the ribbons and decided to throw away some of them in order to make the remaining set stylish. The birthday girl considers a set of ribbons stylish if no greeting written on some ribbon is a substring of another greeting written on some other ribbon. Let us recall that the substring of the string s is a continuous segment of s.

Help Dasha to keep as many ribbons as possible, so that she could brag about them to all of her friends. Dasha cannot rotate or flip ribbons, that is, each greeting can be read in a single way given in the input.

Input

The first line of the input contains integer n (1 ≤ n ≤ 750) — the number of Dasha's relatives and friends.

Each of the next n lines contains exactly one greeting. Each greeting consists of characters 'a' and 'b' only.

The total length of all greetings won't exceed 10 000 000 characters.

Output

In the first line print the maximum size of the stylish set. In the second line print the numbers of ribbons involved in it, assuming that they are numbered from 1 to n in the order they appear in the input. If there are several stylish sets of the maximum size, print any of them.

Examples

Input

5
abab
aba
aabab
ababb
bab


Output

2
2 5

Note

In the sample, the answer that keeps ribbons 3 and 4 is also considered correct.
import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.Arrays;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskE {
        private Edge[] firstEdge;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();

            int length = 0;
            final char[][] greetings = new char[n][];
            for (int i = 0; i < n; ++i) {
                greetings[i] = in.next().toCharArray();
                length += greetings[i].length;
            }

            int lastNode = 2;
            int[] ca = new int[length + 2];
            int[] cb = new int[length + 2];

            int[] which = new int[length + 2];
            Arrays.fill(which, -1);

            for (int i = 0; i < n; ++i) {
                int current = 1;
                for (char c : greetings[i]) {
                    int[] ch = (c == 'a' ? ca : cb);
                    if (ch[current] == 0) {
                        ch[current] = lastNode++;
                    }
                    current = ch[current];
                }
                which[current] = i;
            }

            int[] suffix = new int[lastNode];
            {
                suffix[1] = 0;
                ca[0] = cb[0] = 1;
                int[] queue = new int[length + 2];
                int front = 0, rear = 0;
                queue[rear++] = 1;
                while (front < rear) {
                    int current = queue[front++];
                    for (int i = 0; i < 2; ++i) {
                        int[] ch = i == 0 ? ca : cb;
                        if (ch[current] == 0) {
                            ch[current] = ch[suffix[current]];
                        } else {
                            suffix[ch[current]] = ch[suffix[current]];
                            if (which[ch[current]] == -1) {
                                which[ch[current]] = which[suffix[ch[current]]];
                            }
                            queue[rear++] = ch[current];
                        }
                    }
                }
            }

            boolean[][] rel = new boolean[n][n];
            for (int i = 0; i < n; ++i) {
                int current = 1;
                for (int j = 0; j < greetings[i].length; ++j) {
                    int[] ch = greetings[i][j] == 'a' ? ca : cb;
                    current = ch[current];
                    if (j + 1 == greetings[i].length) {
                        current = suffix[current];
                    }
                    if (which[current] != -1) {
                        // All greetings are different.
                        rel[which[current]][i] = true;
                    }
                }
            }


            for (int k = 0; k < n; ++k) {
                for (int i = 0; i < n; ++i) {
                    for (int j = 0; j < n; ++j) {
                        if (i != j && j != k && k != i) {
                            if (rel[i][k] && rel[k][j]) {
                                rel[i][j] = true;
                            }
                        }
                    }
                }
            }
//
//        MaxFlow flow = new MaxFlow(2 * n + 2, 2 * n, 2 * n + 1);
//        for (int i = 0; i < n; ++i) {
//            flow.insert(2 * n, i, 1);
//            flow.insert(i + n, 2 * n + 1, 1);
//            for (int j = 0; j < n; ++j) {
//                if (i != j && rel[i][j]) {
//                    flow.insert(i, j + n, 1);
//                }
//            }
//        }

            DinicGraph flow = new DinicGraph(2 * n + 2);
            for (int i = 0; i < n; ++i) {
                flow.addEdge(2 * n, i, 1);
                flow.addEdge(i + n, 2 * n + 1, 1);
                for (int j = 0; j < n; ++j) {
                    if (i != j && rel[i][j]) {
                        flow.addEdge(i, j + n, 1);
                    }
                }
            }

            int answer = n - (int) flow.getMaxFlow(2 * n, 2 * n + 1);
            out.println(answer);

            firstEdge = new Edge[n];
            int[] numInEdges = new int[n];
            for (int i = 0; i < n; ++i) {
                for (DinicGraph.Edge e : flow.edges[i]) {
                    if (e.to >= n && e.to < 2 * n && e.cap == e.flow) {
                        new Edge(i, e.to - n);
                        ++numInEdges[e.to - n];
                    }
                }
            }

            int[][] paths = new int[answer][];
            answer = 0;
            for (int i = 0; i < n; ++i) {
                if (numInEdges[i] == 0) {
                    int len = 1;
                    int current = i;
                    while (firstEdge[current] != null) {
                        if (firstEdge[current].next != null) {
                            throw new RuntimeException();
                        }

                        ++len;
                        current = firstEdge[current].to;
                    }

                    paths[answer] = new int[len];
                    len = 0;
                    paths[answer][len++] = i;

                    current = i;
                    while (firstEdge[current] != null) {
                        if (firstEdge[current].next != null) {
                            throw new RuntimeException();
                        }

                        current = firstEdge[current].to;
                        paths[answer][len++] = current;
                    }
                    ++answer;
                }
            }

            if (answer != paths.length) {
                throw new RuntimeException();
            }

            int[] pointers = new int[answer];
            while (true) {
                boolean flag = false;
                for (int i = 0; i < answer; ++i) {
                    for (int j = 0; j < answer; ++j) {
                        if (i != j) {
                            int v = paths[j][pointers[j]];
                            while (rel[paths[i][pointers[i]]][v]) {
                                ++pointers[i];
                                flag = true;
                            }
                        }
                    }
                }
                if (!flag) {
                    break;
                }
            }
            for (int i = 0; i < answer; ++i) {
                if (i > 0) out.print(" ");
                out.print(paths[i][pointers[i]] + 1);
            }
            out.println();
        }

        class Edge {
            int to;
            Edge next;

            Edge(int from, int to) {
                this.to = to;
                this.next = firstEdge[from];
                firstEdge[from] = this;
            }

        }

        static class DinicGraph {
            public ArrayList<Edge>[] edges;
            int[] cur;
            int[] q;
            public int[] d;
            int n;

            public DinicGraph(int n) {
                edges = new ArrayList[n];
                this.n = n;
                for (int i = 0; i < edges.length; i++) {
                    edges[i] = new ArrayList<Edge>();
                }
                q = new int[n];
                d = new int[n];
                cur = new int[n];
            }

            public Edge addEdge(int from, int to, int cap) {
                Edge e1 = new Edge(from, to, 0, cap);
                Edge e2 = new Edge(to, from, 0, 0);
                e1.rev = e2;
                e2.rev = e1;
                edges[from].add(e1);
                edges[to].add(e2);
                return e1;
            }

            boolean bfs(int source, int target) {
                int head = 0;
                int tail = 1;
                Arrays.fill(d, Integer.MAX_VALUE);
                d[source] = 0;
                q[0] = source;
                while (head < tail) {
                    int x = q[head++];
                    for (int i = 0; i < edges[x].size(); i++) {
                        Edge e = edges[x].get(i);
                        if (e.cap - e.flow > 0 && d[e.to] == Integer.MAX_VALUE) {
                            d[e.to] = d[x] + 1;
                            q[tail++] = e.to;
                            if (e.to == target) {
                                return true;
                            }
                        }
                    }
                }
                return false;
            }

            public int dfs(int x, int target, int cMin) {
                if (x == target) {
                    return cMin;
                }
                for (int i = cur[x]; i < edges[x].size(); cur[x] = ++i) {
                    Edge e = edges[x].get(i);
                    if (d[e.to] != d[x] + 1 || e.cap - e.flow == 0) {
                        continue;
                    }
                    int add = dfs(e.to, target, Math.min(cMin, e.cap - e.flow));
                    if (add == 0) {
                        continue;
                    }
                    e.flow += add;
                    e.rev.flow -= add;
                    return add;
                }
                return 0;
            }

            public long getMaxFlow(int source, int target) {
                long flow = 0;
                while (bfs(source, target)) {
                    Arrays.fill(cur, 0);
                    while (true) {
                        int add = dfs(source, target, Integer.MAX_VALUE);
                        if (add == 0) {
                            break;
                        }
                        flow += add;
                    }
                }
                return flow;
            }

            public static class Edge {
                public int from;
                public int to;
                public int flow;
                public int cap;
                public Edge rev;

                public Edge(int from, int to, int flow, int cap) {
                    super();
                    this.from = from;
                    this.to = to;
                    this.flow = flow;
                    this.cap = cap;
                }

            }

        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (Exception e) {
                    throw new UnknownError();
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

