Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"sort"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		input := strings.Split(scanner.Text(), ",")
		cards := make([]int, 5)
		for i :=range input {
			cards[i], _ = strconv.Atoi(input[i])
		}
		sort.Sort(sort.IntSlice(cards))
		if cards[0] == cards[1] && cards[2] == cards[3] && cards[2] == cards[1] {
			fmt.Println("four card")
		} else if cards[1] == cards[2] && cards[3] == cards[4] && cards[3] == cards[2]{
			fmt.Println("four card")
		} else if cards[0] == cards[1] && cards[1] == cards[2] && cards[3] == cards[4] {
			fmt.Println("full house")
		} else if cards[0] == cards[1] && cards[2] == cards[3] && cards[3] == cards[4] {
			fmt.Println("full house")
		} else if cards[0] == 1 && cards[1] == 10 && cards[2] == 11 && cards[3] == 12 && cards[4] == 13 {
			fmt.Println("straight")
		} else if cards[0]+1 == cards[1] && cards[1]+1 == cards[2] && cards[2]+1 == cards[3] && cards[3]+1 == cards[4] {
			fmt.Println("straight")
		} else if (cards[0] == cards[1] && cards[1] == cards[2]) || (cards[1] == cards[2] && cards[2] == cards[3]) || (cards[2] == cards[3] && cards[3] == cards[4]) {
			fmt.Println("three card")
		} else if ((cards[0] == cards[1]) && ((cards[2] == cards[3]) || (cards[3] == cards[4]))) || ((cards[1] == cards[2]) && (cards[3] == cards[4])) {
			fmt.Println("two pair")
		} else if cards[0] == cards[1] || cards[1] == cards[2] || cards[2] == cards[3] || cards[3] == cards[4] {
			fmt.Println("one pair")
		} else {
			fmt.Println("null")
		}
	}
}

C++: #include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define repp(i, n) rep(i, n)
#define reppp(i, n) repp(i, n)
#define rrepp(i, n) rrep(i, n)
#define repss(i, n) reps(i, n)
#define repcc(i, n) repc(i, n)
#define repii(i, a, b) repi(i, a, b)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

void solve() {
  vi32 v(5);
  char _;
  while (true) {
    rep(i, 4) if (!(cin >> v[i] >> _)) return;
    cin >> v[4];
    {
      map<int, int> ma;
      rep(i, 5) ma[v[i]]++;
      bool f = false;
      each(m, ma) {
        if (m.second == 4) f = true;
      }
      if (f) {
        cout << "four card" << '\n';
        continue;
      }
    }
    {
      map<int, int, greater<int>> ma;
      rep(i, 5) ma[v[i]]++;
      if (ma.size() == 2) {
        bool f1 = false, f2 = false;
        each(m, ma) {
          if (m.second == 3) f1 = true;
          if (m.second == 2) f2 = true;
        }
        if (f1 && f2) {
          cout << "full house" << '\n';
          continue;
        }
      }
    }
    {
      sort(all(v));
      if (v == vi32({1, 10, 11, 12, 13})) {
        cout << "straight" << '\n';
        continue;
      }
      bool f = true;
      rep(i, 4) if (v[i + 1] - v[i] != 1) f = false;
      if (f) {
        cout << "straight" << '\n';
        continue;
      }
    }
    {
      map<int, int, greater<int>> ma;
      rep(i, 5) ma[v[i]]++;
      bool f = false;
      each(m, ma) {
        if (m.second == 3) f = true;
      }
      if (f) {
        cout << "three card" << '\n';
        continue;
      }
    }
    {
      map<int, int, greater<int>> ma;
      rep(i, 5) ma[v[i]]++;
      int c = 0;
      each(m, ma) {
        if (m.second == 2) c++;
      }
      if (c == 2) {
        cout << "two pair" << '\n';
        continue;
      }
    }
    {
      map<int, int, greater<int>> ma;
      rep(i, 5) ma[v[i]]++;
      int c = 0;
      each(m, ma) {
        if (m.second == 2) c++;
      }
      if (c == 1) {
        cout << "one pair" << '\n';
        continue;
      }
    }
    cout << "null" << '\n';
  }
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;

int card[13];
int solve(){
    int m;
    vector<int> n;
    for(int i=0;i<13;i++){
        if(card[i]) n.push_back(card[i]);
    }
    for(int i=0;i<n.size();i++){
        for(int j=1;j<n.size()-i;i++){
            if(n[j-1] < n[j]) swap(n[j-1], n[j]);
        }
    }
    if(n.size()==2){
        if(n[0] == 4){
            cout << "four card" << endl;
        }else{
            cout << "full house" << endl;
        }
    }else if(n.size()==3){
        if(n[0] == 3){
            cout << "three card" << endl;
        }else{
            cout << "two pair" << endl;
        }
    }else if(n.size()==4){
        cout << "one pair" << endl;
    }else{
        bool straight=false;
        for(int i=0;i<13-3;i++){
            if(card[i]&&card[i+1]&&card[i+2]&&card[i+3]&&card[(i+4)%13]){
                cout << "straight" << endl;
                straight=true;
                break;
            }
        }
        if(!straight){
            cout << "null" << endl;
        }
    }
}

int main(){
    char comma;
    int m;
    while(cin >> m){
        for(int i=0;i<13;i++){
            card[i] = 0;
        }
        m--;
        card[m]++;
        for(int i=0;i<4;i++){
            cin >> comma >> m;
            m--;
            card[m]++;
        }
        solve();
    }
}