import std.stdio;
import std.string: split;
import std.conv: to;
import std.algorithm: map, filter, any, all, sum, maxElement;
import std.array: array;

struct Halfedge {
  int node;
  int id;
}

auto buildGraph(string[] lines) {
  Halfedge[][int] graph;
  foreach(int id, line; lines) {
    auto nodes = line.split("/").map!(to!int).array;
    auto input = nodes[0], output = nodes[1];
    graph[input] = graph.get(input, []) ~ Halfedge(output, id);
    graph[output] = graph.get(output, []) ~ Halfedge(input, id);
  }
  return graph;
}

Halfedge[][]  paths;

void buildPaths(
  Halfedge[][int] graph,
  int node=0,
  Halfedge[] path=[])
{
  auto unexplored_edges = graph[node].filter!(
    x => path.map!(y => x.id != y.id).all
  );
  if (unexplored_edges.empty) {
    paths ~= path;
  }
  else {
    foreach(edge; unexplored_edges) {
      auto newpath = path.dup ~ edge;
      buildPaths(graph, edge.node, newpath);
    }
  }
}

int pathWeight(Halfedge[] path) {
  return path[0..$-1].map!(x => x.node).sum*2 + path[$-1].node;
}

void main(string[] args){
  File(args[1]).byLineCopy.array.buildGraph.buildPaths;
  writeln(paths.map!(pathWeight).maxElement);
  writeln(paths.maxElement!(p => [p.length, p.pathWeight]).pathWeight);
}