#include <bits/stdc++.h>
using namespace std;
template <class T, class S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
  return os << "(" << v.first << ", " << v.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "[";
  for (int i = int(0); i <= int((static_cast<int>((v).size())) - 1); ++i) {
    if (i) os << ", ";
    os << v[i];
  }
  return os << "]";
}
template <class T>
bool setmax(T& _a, T _b) {
  if (_a < _b) {
    _a = _b;
    return true;
  }
  return false;
}
template <class T>
bool setmin(T& _a, T _b) {
  if (_b < _a) {
    _a = _b;
    return true;
  }
  return false;
}
template <class T>
T gcd(T _a, T _b) {
  return _b == 0 ? _a : gcd(_b, _a % _b);
}
int score(string s, int num) {
  int sumv = 0, maxv = 0;
  for (char c : s) {
    int cur = int(c - 'a' + 1);
    sumv += cur;
    setmax(maxv, cur);
  }
  return sumv * maxv + num;
}
int main() {
  int n;
  cin >> n;
  vector<string> ws(n);
  for (string& w : ws) cin >> w;
  map<string, int> substrings = {{"", 0}};
  for (const auto& w : ws) {
    set<string> tmp;
    for (int i = int(0); i <= int((static_cast<int>((w).size())) - 1); ++i)
      for (int j = int(i); j <= int((static_cast<int>((w).size())) - 1); ++j) {
        tmp.insert(w.substr(i, j - i + 1));
      }
    for (const auto& s : tmp) {
      substrings[s]++;
    }
  }
  vector<string> ss;
  for (const auto& kv : substrings) {
    ss.push_back(kv.first);
  }
  sort((ss).begin(), (ss).end(), [](const string& a, const string& b) {
    return static_cast<int>((a).size()) < static_cast<int>((b).size());
  });
  vector<vector<int> > es(static_cast<int>((ss).size()));
  vector<int> scores(static_cast<int>((ss).size()));
  for (int i = int(0); i <= int((static_cast<int>((ss).size())) - 1); ++i) {
    scores[i] = score(ss[i], substrings[ss[i]]);
    for (int j = int(i + 1); j <= int((static_cast<int>((ss).size())) - 1);
         ++j) {
      if (static_cast<int>((ss[j]).size()) >
          static_cast<int>((ss[i]).size()) + 1) {
        break;
      }
      if (static_cast<int>((ss[j]).size()) ==
          static_cast<int>((ss[i]).size()) + 1) {
        if (ss[j].substr(0, static_cast<int>((ss[i]).size())) == ss[i] ||
            ss[j].substr(1, static_cast<int>((ss[i]).size())) == ss[i]) {
          es[i].push_back(j);
        }
      }
    }
  }
  struct State {
    bool win = false;
    int sx = 0, sy = 0;
    bool operator<(const State& o) const {
      if (win != o.win) return !win;
      if (sx != o.sx) return sx < o.sx;
      if (sy != o.sy) return sy > o.sy;
      return false;
    }
  };
  vector<State> states(static_cast<int>((ss).size()));
  for (int i = int((static_cast<int>((ss).size())) - 1); i >= int(0); --i) {
    for (int j : es[i]) {
      State tmp = states[j];
      tmp.win = !tmp.win, swap(tmp.sx, tmp.sy);
      tmp.sx += scores[j];
      setmax(states[i], tmp);
    }
  }
  printf("%s\n%d %d\n", states[0].win ? "First" : "Second", states[0].sx,
         states[0].sy);
  return 0;
}
