#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	int kkt = 1;
	while (kkt--) {
		ll N; scanf("%lld", &N);
		map<pair<ll, ll>, ll> mp;
		for (int i = 0; i < N; i++) {
			ll x, y, w; scanf("%lld %lld %lld", &x, &y, &w);
			mp[{x, y}] += w;
		}
		ll res = 0;
		for (auto p : mp) {
			{
				ll x = p.first.first;
				ll y = p.first.second;
				ll sum = 0;
				sum += p.second;
				if (mp.find({ x + 1, y }) != mp.end()) sum += mp[{x + 1, y}];
				if (mp.find({ x + 1, y + 1 }) != mp.end()) sum += mp[{x + 1, y + 1}];
				if (mp.find({ x,y + 1 }) != mp.end()) sum += mp[{x, y + 1}];
				chmax(res, sum);
			}

			{
				ll x = p.first.first;
				ll y = p.first.second;
				ll sum = 0;
				sum += p.second;
				if (mp.find({ x + 1, y }) != mp.end()) sum += mp[{x + 1, y}];
				if (mp.find({ x + 1, y - 1 }) != mp.end()) sum += mp[{x + 1, y - 1}];
				if (mp.find({ x,y - 1 }) != mp.end()) sum += mp[{x, y - 1}];
				chmax(res, sum);
			}

			{
				ll x = p.first.first;
				ll y = p.first.second;
				ll sum = 0;
				sum += p.second;
				if (mp.find({ x - 1, y }) != mp.end()) sum += mp[{x - 1, y}];
				if (mp.find({ x - 1, y - 1 }) != mp.end()) sum += mp[{x - 1, y - 1}];
				if (mp.find({ x,y - 1 }) != mp.end()) sum += mp[{x, y - 1}];
				chmax(res, sum);
			}

			{
				ll x = p.first.first;
				ll y = p.first.second;
				ll sum = 0;
				sum += p.second;
				if (mp.find({ x - 1, y }) != mp.end()) sum += mp[{x - 1, y}];
				if (mp.find({ x - 1, y + 1 }) != mp.end()) sum += mp[{x - 1, y + 1}];
				if (mp.find({ x,y + 1 }) != mp.end()) sum += mp[{x, y + 1}];
				chmax(res, sum);
			}

		}

		cout << res << " / 1" << endl;
	}
	return 0;

}

