#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5, MAX_LEN = 42;
char s[MAX_LEN];
map<string, set<string>> m;
pair<int, string> d[MAXN];
pair<set<string>, string> c[MAXN];
vector<vector<string>> ans;
int main() {
  int n;
  scanf("%d\n", &n);
  for (int i = 0; (i) < (n); ++i) {
    gets(s);
    int len = strlen(s);
    int last = len;
    for (int i = (7); (i) < (len); ++i)
      if (s[i] == '/') {
        last = i;
        break;
      }
    string t = "", r = "";
    for (int i = (last); (i) < (len); ++i) t += s[i];
    for (int i = 0; (i) < (last); ++i) r += s[i];
    m[r].insert(t);
  }
  int it = 0;
  for (auto np : m)
    d[it] = make_pair((int)((np.second).size()), np.first), it++;
  int l = (int)((m).size());
  sort(d, d + l);
  for (int i = 0; (i) < (l); ++i) {
    int last = l;
    for (int j = (i); (j) < (l); ++j)
      if (d[j].first != d[i].first) {
        last = j;
        break;
      }
    for (int j = (i); (j) < (last); ++j)
      c[j] = make_pair(m[d[j].second], d[j].second);
    sort(c + i, c + last);
    int cur = i;
    for (int j = (i + 1); (j) < (last); ++j)
      if (c[j].first != c[j - 1].first) {
        if (cur != j - 1) {
          vector<string> v;
          for (int g = (cur); (g) < (j); ++g) v.push_back(c[g].second);
          ans.push_back(v);
        }
        cur = j;
      }
    if (cur != last - 1) {
      vector<string> v;
      for (int g = (cur); (g) < (last); ++g) v.push_back(c[g].second);
      ans.push_back(v);
    }
    i = last - 1;
  }
  printf("%d\n", (int)((ans).size()));
  for (auto &v : ans) {
    for (auto s : v) printf("%s ", s.c_str());
    puts("");
  }
  return 0;
}
