#include <stdio.h>
#include <stdlib.h>
using namespace std;

struct Nod
{
    int val;
    Nod * urm;
};

void inserare_element(Nod *before, int val)
{
    printf("Inseram valoarea %d\n", val);
}

int main()
{
    int n;
    scanf("%d", &n);
    int l[n][n], u[n][n];
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            scanf("%d", &l[i][j]);
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            scanf("%d", &u[i][j]);

    Nod **a = (Nod**)malloc(n * sizeof(Nod*));
    for(int i = 0; i < n; i++)
    {
        Nod * last_element = a[i];
        printf("Linia %d\n", i);
        for(int j = 0; j <= i; j++)
            inserare_element(last_element, l[i][j]);
        for(int j = i; j < n; j++)
            inserare_element(last_element, u[i][j]);
    }

    int v[n];
    for(int i = 0; i < n; i++)
    {
        Nod * current;
        int ind = 0;
        while(current != NULL)
        {
            v[i] += current->val * x[ind];
            if(ind == i)
                ind += (n-i-1)
            ind++;
            current = current->urm;
        }
    }
    return 0;
}