#include <stack>
#include <cstdio>
#include <list>
#include <cassert>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <cmath>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define SZ(x) (int)x.size()
#define Lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define X first
#define Y second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define LC rt << 1, l, mid
#define RC rt << 1|1, mid + 1, r
#define LRT rt << 1
#define RRT rt << 1|1
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int MAXN = 2e4 + 10;
const int MOD = 9901;
const int dir[][2] = { {-1, 0}, {0, -1}, { 1, 0 }, { 0, 1 } };
int cases = 0;
typedef pair<int, int> pii;
 
unsigned int a[MAXN], b[MAXN], c[MAXN], n;
int Add(unsigned int cur)
{
    int cnt = 0;
    for (int i = 0; i < n; i++)
    {
        unsigned int r = min(cur, b[i]);
        if (r < a[i]) continue;
        cnt += (r-a[i]) / c[i] + 1;
    }
    return cnt;
}
 
int main()
{
    //ROP;
    while (~scanf("%d", &n))
    {
        for (int i = 0; i < n; i++) scanf("%u%u%u", &a[i], &b[i], &c[i]);
        unsigned int l = 1, r = (1u<<31), mid, ans = 0;
        while (l < r)
        {
            mid = MID(l, r);
            if (Add(mid) & 1)
            {
                ans = mid;
                r = mid;
            }
            else l = mid+1;
        }
        if (ans == 0) printf("DC Qiang is unhappy.\n");
        else printf("%u %d\n", ans, Add(ans) - Add(ans-1));
    }
    return 0;
}