#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
#include <random>

using namespace std;

#define cauto const auto&
#define ALL(v) begin(v),end(v)
#else
#define ALL(v) (v).begin(),(v).end()
#endif

namespace{
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}
template <class T> inline bool chmin(T &x, const T &y){ if(y < x){ x = y; return true; } return false; }
template <class T> inline bool chmax(T &x, const T &y){ if(x < y){ x = y; return true; } return false; }
template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}
template <class Con>
string concat(const Con &c, const string &spr){
	stringstream ss;
	typename Con::const_iterator it = c.begin(), en = c.end();
	bool fst = true;
	for(; it != en; ++it){
		if(!fst){ ss << spr; }
		fst = false;
		ss << *it;
	}
	return ss.str();
}

template <class Con, class Fun>
vector<typename Con::value_type> cfilter(const Con &c, Fun f) {
	vector<typename Con::value_type> ret;
	typename Con::const_iterator it = c.begin(), en = c.end();
	for(; it != en; ++it){
		if(f(*it)){
			ret.emplace_back(*it);
		}
	}
	return ret;
}
#if __cplusplus >= 201103L
template <class Con, class Fun>
auto cmap(const Con &c, Fun f) -> vector<decltype(f(*c.begin()))> {
	vector<decltype(f(*c.begin()))> ret;
	ret.reserve(c.size());
	for(const auto &x: c){
		ret.emplace_back(f(x));
	}
	return ret;
}
#endif

#if __cplusplus >= 201402L
#define lambda(e) ([&](const auto &_){ return (e); })
#define lambda2(e) ([&](const auto &_a, const auto &_b){ return (e); })
#endif


#define REP(i,n) for(int i=0;i<int(n);++i)
#define RALL(v) (v).rbegin(),(v).rend()
#define tget(t,i) get<i>(t)

#define MOD 1000000007LL
#define EPS 1e-8


void mainmain(){
	int n;
	cin >> n;
	vll ls(n), rs(n);
	REP(i, n){
		LL t, l, r;
		cin >> t >> l >> r;
		l *= 10;
		r *= 10;
		if(t == 2 || t == 4){ --r; }
		if(t == 3 || t == 4){ ++l; }
		ls[i] = l;
		rs[i] = r;
	}
	int ans = 0;
	REP(i, n)
	REP(j, i){
		if(!(rs[i] < ls[j] || rs[j] < ls[i])){
			++ans;
		}
	}
	cout << ans << "\n";
}



}
int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	cout << fixed << setprecision(10);
	cerr << fixed << setprecision(4);
	mainmain();
}

#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <iomanip>

using namespace std;

int main(){
    long k;
    cin >> k;
    string s,t;
    cin >> s >> t;
    vector<long> viCount(10,k);
    vector<long> viTak(10,0), viAok(10,0);
    for(long i = 0; i < 4; i++){
        int j1 = s[i] - '0';
        int j2 = t[i] - '0';
        viCount[j1]--;
        viTak[j1]++;
        viCount[j2]--;
        viAok[j2]++;
    }
    
    double dAns = 0.0;
    for(int i = 1; i <= 9; i++){
        for(int j = 1; j <= 9; j++){
            vector<long> viTakThis = viTak, viAokThis = viAok;
            viTakThis[i]++;
            viAokThis[j]++;
            long nTak=0,nAok=0;
            for(long k = 1; k <= 9; k++){
                nTak += pow(10,viTakThis[k]) * k;
                nAok += pow(10,viAokThis[k]) * k;
            }
            if(nTak > nAok){
                double dThis = double(viCount[i]*viCount[j]);
                dThis -= double(i==j ? viCount[i] : 0);
                dThis /= double((9*k-8)*(9*k-9));
                dAns += max(0.0, dThis);
            }
        }
    }
    cout << dAns << endl;
    return 0;
}