#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e3 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
int n, ans, l[MAX_N], r[MAX_N];
void f(int idx, ll sum) {
if (idx == n) ans += (sum*sum*sum*sum + 2*sum*sum) % 5 + 1;
for (int x = l[idx]; x <= r[idx]; x++) f(idx + 1, sum + x);
}
void solve() {
cin >> n;
for (int i = 0; i < n; i++) cin >> l[i] >> r[i];
f(0, 0);
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int tc; tc = 1;
for (int t = 1; t <= tc; t++) {
// cout << "Case #" << t << ": ";
solve();
}
}
