#include <iostream>
#include <fstream>
#include <cstring>


using namespace std;

const int MAXN = 1000000;
const int INF = 100000000000;

int n;
int n1[MAXN];
int n2[MAXN];

int v[MAXN];
int h[MAXN];

int dist(int x, int y) {
    int ris = x-y;
    if (ris>0) return ris;
    else return -ris;
}

//int min(int x, int y) {
//    if (x<y) return x;
//    else if (x==y) {
//        countEq*=2;
//        return x;
//    }
//    else return y;
//}

int min(int x, int y) {
    if (x<y) return x;
    else return y;
}

void printN() {
    for (int i = 0; i < n; i++) {
        cout << n1[i] << " ";
    }
    cout << endl;
    for (int i = 0; i < n; i++) {
        cout << n2[i] << " ";
    }
    cout << endl;
}

void printVH() {
    for (int i = 0; i < n; i++) {
        cout << v[i] << " ";
    }
    cout << endl;
    for (int i = 0; i < n; i++) {
        cout << h[i] << " ";
    }
    cout << endl;
}

void solve() {
    v[n-1] = dist(n1[n-1], n2[n-1]);
    h[n-1] = INF;
    v[n-2] = dist(n1[n-2], n2[n-2])+min(v[n-1],h[n-1]);
    h[n-2] = dist(n1[n-1],n1[n-2]) + dist(n2[n-1], n2[n-2]);
    for (int i = n-3; i >= 0; i--) {
        v[i] = dist(n1[i],n2[i]) + min(v[i+1],h[i+1]);
        h[i] = dist(n1[i],n1[i+1]) + dist(n2[i],n2[i+1]) + min(v[i+2],h[i+2]);
    }

}

int checkDoppiCasi() {
    int ris = 1;
    for (int i = 0; i < n; i++) {
        if (v[i]==h[i]) ris*=2;
    }
    return ris;
}

int main()
{
    ifstream in("input.txt");
    ofstream out("output.txt");
    in >> n;
    for (int i = 0; i < n; i++) {
        in >> n1[i];
    }
    for (int i = 0; i < n; i++) {
        in >> n2[i];
    }
//    printN();
//    cout << INF;

    solve();
//    printVH();
//    cout << min(v[0],h[0]) << endl;
//    cout << checkDoppiCasi() << endl;

    out << min(v[0],h[0]) << endl;
    out << checkDoppiCasi() << endl;
    return 0;
}