#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define go(xx,yy,zz) for(ll x=xx-1;x<=xx+1;x++)for(ll y=yy-1;y<=yy+1;y++)for(ll 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;
const ll J=1e18,K=1e6+7,N=2e4+7;
ll n,a,b,c,vis[N],ans;
struct nod { ll x,y,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,ll> mp;
map<nod,ll> pm;
vector<ll> v;
bool chk(ll x,ll y,ll z) { return 0<=x&&x<a&&0<=y&&y<b&&0<=z&&z<c; }
void dfs(nod p) {
	pm.erase(p);
	ll x=p.x,y=p.y,z=p.z;
	#define goo(xx,yy,zz) if (chk(xx,yy,zz)&&pm.count({xx,yy,zz})) dfs({xx,yy,zz});
	goo(x-1,y,z) goo(x+1,y,z)
	goo(x,y-1,z) goo(x,y+1,z)
	goo(x,y,z-1) goo(x,y,z+1)
}
void solve() {
	queue<ll> q;
	for (ll i:v) q.push(i);
	while (!q.empty()) {
		ll p=q.front(); q.pop();
		go(d[p].x,d[p].y,d[p].z) if (chk(x,y,z)) {
			if (mp.count({x,y,z})) {
				ll t=mp[{x,y,z}];
				if (!vis[t]) v.pb(t),vis[t]=1,q.push(t);
			}
			else pm[{x,y,z}]=1;
		}
	}
	v.clear();
	ans--;
	while (pm.size()) ans++,dfs(pm.begin()->fi);
}
void mian() {
	scanf("%lld%lld%lld%lld",&a,&b,&c,&n),ans=1;
	for (ll i=1;i<=n;i++) scanf("%lld%lld%lld",&d[i].x,&d[i].y,&d[i].z),mp[d[i]]=i;
	for (ll i=1;i<=n;i++) if (d[i].x==0||d[i].x==a-1||d[i].y==0||d[i].y==b-1||d[i].z==0||d[i].z==c-1) vis[i]=1,v.pb(i);
	if (v.size()) solve();
	for (ll i=1;i<=n;i++) if (!vis[i]) vis[i]=1,v.pb(i),solve();
	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;
}