#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define go(xx,yy,zz) for(int x=xx-1;x<=xx+1;x++)for(int y=yy-1;y<=yy+1;y++)for(int z=zz-1;z<=zz+1;z++)
using namespace std; bool MEM;
using ll=long long; using ld=long double;
using pii=pair<int,int>; using pll=pair<ll,ll>;
const int I=1e9,K=1e6+7,N=5e6+7;
const ll J=1e18;
int n,m,nm,a,b,c,ans;
struct nod {
	int x,y,z;
	bool operator == (const nod &b) const { return x==b.x&&y==b.y&&z==b.z; }
	bool operator < (const nod &b) const { return x!=b.x?x<b.x:y!=b.y?y<b.y:z<b.z; }
} d[N];
map<nod,int> mp;
vector<int> v;
bool chk(int x,int y,int z) { return 0<=x&&x<a&&0<=y&&y<b&&0<=z&&z<c; }
struct dsu {
	int f[N];
	void ini(int n) { iota(f+1,f+n+1,1); }
	int fnd(int x) { return f[x]==x?x:f[x]=fnd(f[x]); }
	void mrg(int x,int y) { f[fnd(x)]=fnd(y); }
} D;
void solve(int o) {
	map<pii,vector<nod>> pm;
	for (int i=1;i<=m;i++) pm[o==0?(pii){d[i].x,d[i].y}:o==1?(pii){d[i].x,d[i].z}:(pii){d[i].y,d[i].z}].pb(d[i]);
	for (auto vv:pm) {
		vector<nod> v=vv.se;
		for (int i=0;i+1<v.size();i++) {
			int x=mp[v[i]],y=mp[v[i+1]];
			if (x>n&&y>n) D.mrg(x,y);
		}
	}
}
void mian() {
	scanf("%d%d%d%d",&a,&b,&c,&n);
	if (!n) return cout<<"0",void();
	for (int i=1;i<=n;i++) scanf("%d%d%d",&d[i].x,&d[i].y,&d[i].z),mp[d[i]]=i;
	nm=m=n;
	for (int i=1;i<=n;i++) {
		go(d[i].x,d[i].y,d[i].z) if (chk(x,y,z)) d[++m]={x,y,z};
		for (int x:{0,d[i].x,a-1}) for (int y:{0,d[i].y,b-1}) for (int z:{0,d[i].z,c-1}) d[++m]={x,y,z};
	}
	sort(d+1,d+m+1),m=unique(d+1,d+m+1)-1-d;
	for (int i=1;i<=m;i++) if (!mp[d[i]]) mp[d[i]]=++nm;
	D.ini(m);
	for (int o=0;o<3;o++) solve(o);
	for (int i=n+1;i<=m;i++) ans+=D.fnd(i)==i;
	cout<<ans;
}
bool ORY; int main() {
//	while (1)
//	int t; for (scanf("%d",&t);t--;)
	mian();
	cerr<<"\n"<<abs(&MEM-&ORY)/1048576<<"MB";
	return 0;
}