#include<bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << ": " << (x) << endl
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define dwn(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()
 
#define x first
#define y second
using pii = pair<int, int>;
using ll = long long;
 
inline void read(int &x){
    int s=0; x=1;
    char ch=getchar();
    while(ch<'0' || ch>'9') {if(ch=='-')x=-1;ch=getchar();}
    while(ch>='0' && ch<='9') s=(s<<3)+(s<<1)+ch-'0',ch=getchar();
    x*=s;
}

// set<pii> st;

map<pii, int> mp;
int tot;

struct Seg{
	pii a, b;
};

vector<Seg> seg;

const int N=1e5+5;

int deg[N];
int f[N];

int find(int x){
	return f[x]==x? x: f[x]=find(f[x]);
}

bool ng[N];

signed main(){
	rep(i, 1, N-1) f[i]=i;
	string s;
	while(getline(cin, s)){
		int cur=0;
		int n=s.size();
		vector<int> buf;
		rep(i, 1, n-1){
			if(isdigit(s[i])){
				cur=cur*10+(s[i]-'0');
			}
			else if(isdigit(s[i-1])){
				buf.pb(cur);
				cur=0;
			}
		}
		
		for(int i=0; i<buf.size(); i+=4){
			pii fir={buf[i], buf[i+1]};
			pii sec={buf[i+2], buf[i+3]};
			if(!mp.count(fir)) mp[fir]=++tot;
			if(!mp.count(sec)) mp[sec]=++tot;
			int u=mp[fir], v=mp[sec];
			
			// seg.pb({buf[i], buf[i+1]});
			deg[u]++;
			deg[v]++;
			
			f[find(u)]=find(v);
		}
	}
	
	int fir=0, sec=0;
	rep(i, 1, tot){
		if(i==find(i)){
			fir++;
		}
		if(deg[i]!=2) ng[find(i)]=true;
	}
	// debug(tot);
	// rep(i, 1, tot) debug(deg[i]);
	rep(i, 1, tot) if(i==find(i) && !ng[i]) sec++;
	cout<<fir<<" "<<sec<<endl;
	
	return 0;
}