#include <bits/stdc++.h>
using namespace std;
vector<int> sum, mx, cnt;
vector<vector<int> > g;
vector<vector<int> > dp;
vector<int> calc(int cur, int turn) {
  vector<int>& ret = dp[cur];
  if (ret[0] || ret[1]) return ret;
  if (g[cur].empty()) {
    ret[1 - turn] = 1;
    return ret;
  }
  for (int i = 0; i < (int)g[cur].size(); i++) {
    int ncur = g[cur][i];
    int temp = sum[ncur] * mx[ncur] + cnt[ncur];
    vector<int> v = calc(ncur, 1 - turn);
    v[2 + turn] += temp;
    if (v[turn] > ret[turn] ||
        (v[turn] == ret[turn] && v[2 + turn] > ret[2 + turn]) ||
        (v[turn] == ret[turn] && v[2 + turn] == ret[2 + turn] &&
         v[2 + (1 - turn)] < ret[2 + (1 - turn)]))
      ret = v;
  }
  return ret;
}
int main() {
  int n;
  string str;
  cin >> n;
  map<string, int> m, ids;
  ids[""];
  m[""];
  for (int i = 0; i < n; i++) {
    cin >> str;
    set<string> seen;
    for (int j = 0; j < (int)str.size(); j++) {
      string temp = "";
      for (int k = j; k < (int)str.size(); k++) {
        temp += str[k];
        if (seen.insert(temp).second) {
          m[temp]++;
          if (!ids.count(temp)) {
            int x = ids.size();
            ids[temp] = x;
          }
        }
      }
    }
  }
  sum = mx = cnt = vector<int>(ids.size());
  g = vector<vector<int> >(ids.size());
  for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) {
    int id = ids[it->first];
    cnt[id] = it->second;
    for (int i = 0; i < (int)it->first.size(); i++) {
      sum[id] += it->first[i] - 'a' + 1;
      mx[id] = max(mx[id], it->first[i] - 'a' + 1);
    }
    for (char c = 'a'; c <= 'z'; c++) {
      string temp = it->first;
      temp += c;
      if (ids.count(temp)) g[id].push_back(ids[temp]);
      temp = "";
      temp += c;
      temp += it->first;
      if (ids.count(temp)) g[id].push_back(ids[temp]);
    }
  }
  dp = vector<vector<int> >(ids.size(), vector<int>(4, 0));
  vector<int> ret = calc(0, 0);
  if (ret[0])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  cout << ret[2] << " " << ret[3] << endl;
  return 0;
}
