import sys

def bai2022():

dulieu = sys.stdin.read().split()
if not dulieu:
    return

n = int(dulieu[0])
if n == 1:
    print("Yes")
    return

dist = [[0] * (n + 1) for _ in range(n + 1)]
bien = 1
for i in range(1, n):
    for j in range(i + 1, n + 1):
        giatri = int(dulieu[bien])
        dist[i][j] = dist[j][i] = giatri
        bien += 1
        if giatri <= 0:
            print("No")
            return

for i in range(1, n + 1):
    for j in range(i + 1, n + 1):
        for k in range(j + 1, n + 1):
            s1 = dist[i][j] + dist[k][1] if k != 1 and i != 1 and j != 1 else -1
            val = dist[1][i] + dist[1][j] - dist[i][j]
            if val < 0 or val % 2 != 0:
                print("No")
                return
            
for i in range(2, n + 1):
    for j in range(i + 1, n + 1):
        for k in range(j + 1, n + 1):
            s1 = dist[i][j] + dist[1][k]
            s2 = dist[i][k] + dist[1][j]
            s3 = dist[j][k] + dist[1][i]
            
            sums = sorted([s1, s2, s3])
            if sums[1] != sums[2]:
                print("No")
                return

print("Yes")

if name == "main":

bai2022()

include <stdio.h>

int mt[3000][3000]; int kc[3000]; int dd[3000]; int tr[3000];

int dc[3000]; int nc[6005]; int tc[6005]; int ts[6005]; int sm = 0;

static inline void tmc(int u, int v, int w) {

++sm;
tc[sm] = v;
ts[sm] = w;
nc[sm] = dc[u];
dc[u] = sm;

}

static inline int ds() {

int k = 0, c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') {
    k = k * 10 + c - '0';
    c = getchar();
}
return k;

}

int hd[3000]; int kct[3000];

int main() {

int sn = ds();
for (int i = 0; i < sn - 1; ++i) {
    for (int j = i + 1; j < sn; ++j) {
        mt[i][j] = ds();
        mt[j][i] = mt[i][j];
    }
}

for (int i = 0; i < sn; ++i) {
    kc[i] = 1000000000;
    dd[i] = 0;
    tr[i] = -1;
}

kc[0] = 0;

for (int i = 0; i < sn; ++i) {
    int u = -1;
    for (int j = 0; j < sn; ++j) {
        if (!dd[j] && (u == -1 || kc[j] < kc[u])) {
            u = j;
        }
    }

    if (kc[u] == 1000000000) {
        puts("No");
        return 0;
    }

    dd[u] = 1;
    if (tr[u] != -1) {
        if (kc[u] <= 0) {
            puts("No");
            return 0;
        }
        tmc(tr[u], u, kc[u]);
        tmc(u, tr[u], kc[u]);
    }

    for (int v = 0; v < sn; ++v) {
        if (!dd[v] && mt[u][v] < kc[v]) {
            kc[v] = mt[u][v];
            tr[v] = u;
        }
    }
}

for (int i = 0; i < sn; ++i) {
    for (int j = 0; j < sn; ++j) kct[j] = -1;
    int d = 0, c = 0;
    hd[c++] = i;
    kct[i] = 0;

    while (d < c) {
        int u = hd[d++];
        for (int e = dc[u]; e; e = nc[e]) {
            int v = tc[e];
            if (kct[v] == -1) {
                kct[v] = kct[u] + ts[e];
                hd[c++] = v;
            }
        }
    }

    for (int j = 0; j < sn; ++j) {
        if (kct[j] != mt[i][j]) {
            puts("No");
            return 0;
        }
    }
}

puts("Yes");
return 0;

}