private int checkStraight(int player) {
		TreeSet<Integer> set = new TreeSet<Integer>();
		for (int card : players[player].cards) {
			set.add(card % 13);
		}
		
		int[] hand = new int[5];
		int i = 0;
		for (int card : set) {
			hand[i++] = card;
		}
		
		if (hand[1] == hand[0] + 1 && hand[2] == hand[1] + 1 && hand[3] == hand[2] + 1 && hand[4] == hand[3] + 1)
			return hand[4];
		
		return -1;
	}