20191024

#include<bits/stdc++.h>
#define ll long long
#define maxn 10000010
using namespace std;
bool not_p[10000007];
int p[maxn];
struct os
{
	int x,y;
}chart[maxn];
int a[maxn];
int main()
{
	freopen("sophon.in","r",stdin);
	freopen("sophon.out","w",stdout);
	int T;
	cin>>T;
	int maxx=-1;
	p[1]=1;
	p[0]=1;
	for (int i=1;i<=T;i++)
	{
		scanf("%d",&a[i]);
		maxx=max(maxx,a[i]);
	}
	int cnt=0;
	for (int i=2;i<=maxx;i++)
	{
		if (!not_p[i])
			p[++cnt]=i;
		for (int j=1;j<=cnt;j++)
		{
			if (p[j]*i>maxx)
				break;
			not_p[p[j]*i]=true;
			if (i%p[j]==0)
				break;
		}
	}
	for (int i=4;i<=maxx;i+=2)
	{
		for (int j=2;j<=i;j++)
			if(!not_p[j]&&!not_p[i-j])
			{
				chart[i].x=j,chart[i].y=i-j;
				break;
			}
	}
	for (int i=1;i<=T;i++)
	{
		if ((a[i]-5)%2==0&&(a[i]-5)>=4)
			printf("2 3 %d %d\n",chart[a[i]-5].x,chart[a[i]-5].y);
		else if ((a[i]-4)%2==0&&(a[i]-4)>=4)
			printf("2 2 %d %d\n",chart[a[i]-4].x,chart[a[i]-4].y);
		else
			printf("impossible\n");
	}
	return 0;
}

#include<bits/stdc++.h>
#define ll long long
#define maxn 10010
using namespace std;
int a[3][maxn];
int ans=0;
int n;
bool vis[3][maxn];
int sx[6]={0,0,1,1,1,0},sy[6]={0,-1,-1,0,1,1};
int xx[6]={0,0,-1,-1,-1,0},xy[6]={0,-1,-1,0,1,1};
void dfs(int x,int y,int step)
{
//	cout<<x<<' '<<y<<' '<<step<<endl;
	if (step>=n*2)
	{
		//cout<<ans<<' ';
		ans++;
		return;
	}
	if (x==1)
	{
		for (int i=1;i<=5;i++)
		{
			if (!vis[x+sx[i]][y+sy[i]]&&x+sx[i]>0&&y+sy[i]>0&&x+sx[i]<=2&&y+sy[i]<=n)
			{
				vis[x+sx[i]][y+sy[i]]=1;
				dfs(x+sx[i],y+sy[i],step+1);
				vis[x+sx[i]][y+sy[i]]=0;
			}
		} 
	}
	if (x==2)
	{
		for (int i=1;i<=5;i++)
		{
			if (!vis[x+xx[i]][y+xy[i]]&&x+xx[i]>0&&y+xy[i]>0&&x+xx[i]<=2&&y+xy[i]<=n)
			{
				vis[x+xx[i]][y+xy[i]]=1;
				dfs(x+xx[i],y+xy[i],step+1);
				vis[x+xx[i]][y+xy[i]]=0;
			}
		} 
	}
}
int main()
{
	freopen("waterdrop.in","r",stdin);
	freopen("waterdrop.out","w",stdout);
	cin>>n;
	int anss=0;
	for (int i=1;i<=2;i++)
		for (int j=1;j<=n;j++)
		{
			vis[i][j]=1;
			dfs(i,j,1),anss+=ans,ans=0;
			vis[i][j]=0;
		}
	cout<<anss<<endl;
	return 0;
}

#include<bits/stdc++.h>
#define maxn 200100
#define ll long long
#define gc getchar()
using namespace std;
ll segtree[4*maxn][31],a[maxn],cvr[4*maxn];
ll segsum[4*maxn];
int is_in[31];
int ha;
inline ll read()
{
    ll x=0,c=getchar();
    while (!isdigit(c))
        c=getchar();
    while (isdigit(c))
        x=x*10+c-'0',c=getchar();
    return x;
}
inline void pushup(int rt)
{
	segsum[rt]=0;
	for (int i=1;i<=ha;i++)
	{
		segtree[rt][i]=segtree[rt*2][i]+segtree[rt*2+1][i];
		if (segtree[rt][i]!=0)
			segsum[rt]++;
	}
}
inline void pushdown(int rt,int lo)
{
	if (cvr[rt])
	{
		for (int i=1;i<=ha;i++)
			segtree[rt*2][i]=0;
		segtree[rt*2][cvr[rt]]=lo;
		cvr[rt*2]=cvr[rt];
		segsum[rt*2]=1;
		for (int i=1;i<=ha;i++)
			segtree[rt*2+1][i]=0;
		segtree[rt*2+1][cvr[rt]]=lo;
		cvr[rt*2+1]=cvr[rt];
		cvr[rt]=0;
		segsum[rt*2+1]=1;
	}
}
inline void lazy(int rt,int k,int lo)
{
	for (int i=1;i<=ha;i++)
		segtree[rt][i]=0;
	segtree[rt][k]=lo;
	segsum[rt]=1;
	cvr[rt]=k;
}
inline void update(int l,int r,int L,int R,int c,int rt)//区间修改 
{
	if (l>=L&&r<=R)
	{	
		lazy(rt,c,r-l+1);
		return;
	}
	int mm=(l+r)>>1;
	pushdown(rt,r-l+1);
	if (L<=mm)
		update(l,mm,L,R,c,rt*2);
	if (R>mm)
		update(mm+1,r,L,R,c,rt*2+1);
	pushup(rt);
} 
inline void  query(int l,int r,int L,int R,int rt)//区间查询 
{
	if (l>=L&&r<=R)
	{
		for (int ii=1;ii<=ha;ii++)
			if (segtree[rt][ii]!=0)
				is_in[ii]=1;
		return;
	}
	int mm=(l+r)>>1;
	pushdown(rt,r-l+1);
	if (L<=mm)
		query(l,mm,L,R,rt*2);
	if (R>mm)
		query(mm+1,r,L,R,rt*2+1);
	return;
}
int main()
{
	freopen("forest.in","r",stdin);
	freopen("forest.out","w",stdout);
	int m,n;
	n=read();
	ha=read();
	m=read();
	for (int i=1;i<=m;i++)
	{
		int p;
		p=read();
		if (p==1)
		{
			int k,pl,pr;
			pl=read();
			pr=read();
			k=read();
			update(1,n,pl,pr,k,1);
		}
		if (p==2)
		{
			int pl,pr,ans;
			pl=read();
			pr=read();
			int as=0;
			query(1,n,pl,pr,1);
			for (int j=1;j<=ha;j++)
				if (is_in[j])
					as++;
			printf("%d\n",as);
			memset(is_in,0,sizeof(is_in));
		}
	}
 	return 0;
}