Problem: There are some websites that are accessible through several different addresses. For example, for a long time Codeforces was accessible with two hostnames codeforces.com and codeforces.ru.

You are given a list of page addresses being queried. For simplicity we consider all addresses to have the form http://<hostname>[/<path>], where:

  * <hostname> — server name (consists of words and maybe some dots separating them), 
  * /<path> — optional part, where <path> consists of words separated by slashes. 



We consider two <hostname> to correspond to one website if for each query to the first <hostname> there will be exactly the same query to the second one and vice versa — for each query to the second <hostname> there will be the same query to the first one. Take a look at the samples for further clarifications.

Your goal is to determine the groups of server names that correspond to one website. Ignore groups consisting of the only server name.

Please note, that according to the above definition queries http://<hostname> and http://<hostname>/ are different.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of page queries. Then follow n lines each containing exactly one address. Each address is of the form http://<hostname>[/<path>], where:

  * <hostname> consists of lowercase English letters and dots, there are no two consecutive dots, <hostname> doesn't start or finish with a dot. The length of <hostname> is positive and doesn't exceed 20. 
  * <path> consists of lowercase English letters, dots and slashes. There are no two consecutive slashes, <path> doesn't start with a slash and its length doesn't exceed 20. 



Addresses are not guaranteed to be distinct.

Output

First print k — the number of groups of server names that correspond to one website. You should count only groups of size greater than one.

Next k lines should contain the description of groups, one group per line. For each group print all server names separated by a single space. You are allowed to print both groups and names inside any group in arbitrary order.

Examples

Input

10
http://abacaba.ru/test
http://abacaba.ru/
http://abacaba.com
http://abacaba.com/test
http://abacaba.de/
http://abacaba.ru/test
http://abacaba.de/test
http://abacaba.com/
http://abacaba.com/t
http://abacaba.com/test


Output

1
http://abacaba.de http://abacaba.ru 


Input

14
http://c
http://ccc.bbbb/aba..b
http://cba.com
http://a.c/aba..b/a
http://abc/
http://a.c/
http://ccc.bbbb
http://ab.ac.bc.aa/
http://a.a.a/
http://ccc.bbbb/
http://cba.com/
http://cba.com/aba..b
http://a.a.a/aba..b/a
http://abc/aba..b/a


Output

2
http://cba.com http://ccc.bbbb 
http://a.a.a http://a.c http://abc 

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

import static java.lang.StrictMath.*;

public class HostnameAliases {

    private static final String INPUT_FILE = "input.txt";
    
    private static final String ONLINE_JUDGE = "ONLINE_JUDGE";

    public static void main(String[] args) {
        boolean oj = System.getProperty(ONLINE_JUDGE) != null;

        try {
            InputReader reader = new InputReader(oj ? System.in : new FileInputStream(INPUT_FILE));
            PrintWriter writer = new PrintWriter(System.out);
            new Solver(reader).run(writer);
            writer.close();
        }
        catch (IOException e) {
            new RuntimeException(e);
        }
    }
}

class Solver {

    public static final int HOST_NAME_BEGIN_POSITION = 7;

    public Solver(InputReader reader) throws IOException {
        n = reader.nextInt();
        a = new String[n];
        for (int i = 0; i < n; ++i) {
            a[i] = reader.next();
        }
        trie = new Trie("");
        multiCount = 0;
        temp = new Host("");
        hosts = new TreeSet<>();
    }

    public void run(PrintWriter writer) throws IOException {
        for (String s: a) {
            add(s);
        }

        StringBuilder sb = new StringBuilder();
        for (Host host: hosts) {
            trie.add(unite(sb, host), host.name);
        }

        writer.println(multiCount);
        trie.print(writer);
    }

    private String unite(StringBuilder sb, Host host) {
        sb.setLength(0);
        for (String path: host.pathes) {
            sb.append(path);
            sb.append('$');
        } 
        return sb.toString();
    }

    private void add(String address) {
        int p = findBeginPathPosition(address);
        String host = getHost(p, address);
        String path = getPath(p, address);
        add(host, path);
    }

    private void add(String host, String path) {
        temp.name = host;
        Host h = hosts.floor(temp);
        if (h == null || !h.name.equals(host)) {
            h = new Host(host);
            hosts.add(h);
        }
        h.pathes.add(path);
    }

    private String getHost(int p, String address) {
        return p == -1 ? 
            address.substring(HOST_NAME_BEGIN_POSITION) : 
            address.substring(HOST_NAME_BEGIN_POSITION, p);
    }

    private String getPath(int p, String address) {
        return p == -1 ? "" : address.substring(p);
    }

    private int findBeginPathPosition(String address) {
        return address.indexOf("/", HOST_NAME_BEGIN_POSITION);
    }

    private Host temp;
    private TreeSet<Host> hosts;

    private Trie trie;

    private int n;
    private String[] a;

    private int multiCount;

    class Trie {

        public static final int ALPHABET_SIZE = 1<<7;

        public Trie(String t) {
            this.t = t;
            edges = new Trie[ALPHABET_SIZE];
        }

        public Trie(String t, String info) {
            this(t);
            setLeaf(info);
        }

        public void add(String s, String info) {
            add(s, null, info);
        }

        public void add(String s, Trie parent, String info) {  
            for (int i = 0; i < min(s.length(), t.length()); ++i) {
                if (s.charAt(i) != t.charAt(i)) {
                    split(i, s, parent, info);
                    return;
                }
            }
            if (s.length() == t.length()) {
                setLeaf(info);
            } 
            else if (s.length() < t.length()) {
                split(s.length(), s, parent, info);
            }
            else {
                int i = getIndex(s.charAt(t.length()));
                if (edges[i] != null) {
                    edges[i].add(s.substring(t.length()), this, info);
                }
                else {
                    edges[i] = new Trie(s.substring(t.length()), info);
                }
            }
        }

        public void print(PrintWriter writer) {
            if (infos != null && infos.size() > 1) {
                writer.print("http://");
                writer.print(infos.get(0)); 
                for (int i = 1; i < infos.size(); ++i) {
                    writer.print(" http://");
                    writer.print(infos.get(i));
                }
                writer.println();
            }
            for (int i = 0; i < ALPHABET_SIZE; ++i) {
                if (edges[i] != null) {
                    edges[i].print(writer);
                }
            }
        }

        private void split(int i, String s, Trie parent, String info) {
            String commonPrefix = s.substring(0, i);
            Trie common = i == s.length() ? new Trie(commonPrefix, info) : new Trie(commonPrefix); 

            parent.edges[getIndex(commonPrefix)] = common;

            t = t.substring(i);
            common.edges[getIndex(t)] = this;

            if (i < s.length()) {
                s = s.substring(i);
                common.edges[getIndex(s)] = new Trie(s, info);
            }
        }

        private int getIndex(String s) {
            return s.charAt(0);
        }

        private int getIndex(char c) {
            return c;
        }

        private boolean isLeaf() {
            return infos != null;
        }

        private void setLeaf(String info) {
            if (infos == null) {
                infos = new ArrayList<String>();
            }
            infos.add(info);

            if (infos.size() == 2) {
                ++multiCount;
            }
        }

        private List<String> infos;

        private String t;
        private Trie edges[];
    }

}

class Host implements Comparable<Host> {

    public Host(String name) {
        this.name = name; 
        pathes = new TreeSet<String>();
    }

    @Override
    public int compareTo(Host other) {
        return name.compareTo(other.name);
    }

    String name;
    Set<String> pathes;
}

class InputReader {
 	
    public BufferedReader reader;
    public StringTokenizer tokenizer;

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

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

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

}