public int minPacks(int R, int G, int B)
	{
		int[] list = { R, G, B };
		int count = 0;
		Arrays.sort(list);
		int min = list[0];
		for (int i = 0; i < list.length; i++) {
			list[i] -= min;
		}
		count += min;
		for (int j = 3; j > 1; j--) {
			for (int i = 0; i < 3; i++) {
				int tmp = list[i] / j;
				count += tmp;
				list[i] -= tmp * j;
			}
		}
		if (list[1] + list[2] == 2) {
			count++;
			list[1]--;
			list[2]--;
		}
		return count + list[1] + list[2];
	}