#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cstdio>
using namespace std;
char s[5010];
int main()
{int n,i,sum=0;scanf("%s",s); n=strlen(s);for(i=0;i<n;i++)if(s[i]=='0')sum++;int flag=0;if(sum==2||n-sum==2||(s[0]==s[1]&&s[1]!=s[2]))flag=1;for(i=3;i<=n;i++)if(s[i-3]!=s[i-2]&&s[i-2]==s[i-1]&&s[i-1]!=s[i])flag=1;if(flag)printf("Y");else printf("N");
}

#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cstdio>
using namespace std;
const int mod=1000000007;
int n,m;
struct data{int x,id;
}a[2010];
int b[1010],rank[2010],c[2010],f[1010][2010];
bool cmp(data a,data b){return a.x<b.x;}
int low(int x){return x&(-x);}
void add(int x,int k){for(;x<=n;x+=low(x))c[x]=(c[x]+k)%mod;}
int work(int x){int sum=0;for(;x;x-=low(x))sum=(sum+c[x])%mod;return sum;}
int main()
{int i,j;scanf("%d%d",&n,&m);for(i=1;i<=n;i++)scanf("%d",&a[i].x),a[i].id=i;for(i=1;i<=m;i++)scanf("%d",&b[i]);sort(a+1,a+n+1,cmp);for(i=1;i<=n;i++)rank[a[i].id]=i;for(i=1;i<=n;i++)f[1][i]=1;for(i=2;i<=m;i++){for(j=1;j<=n;j++)c[j]=0;for(j=1;j<=n;j++){int l=0,r=n+1;while(l+1<r){int mid=(l+r)>>1;if(a[mid].x>b[i]-b[i-1]+a[rank[j]].x)r=mid;else l=mid;}f[i][j]=work(l); add(rank[j],f[i-1][j]);}}int ans=0;for(i=1;i<=n;i++)ans=(ans+f[m][i])%mod;printf("%d",ans);
}

#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cstdio>
using namespace std;
int fir[100010],to[600010],w[600010],ne[600010];
int dist[100010],q[5000010],inq[100010];
int a[10010];
int n,m,k,tot=0;
void add(int x,int y,int z){to[++tot]=y; w[tot]=z; ne[tot]=fir[x]; fir[x]=tot;}
int spfa(int p)
{int i,h=1,t=0;for(i=1;i<=n;i++)dist[i]=1<<30,inq[i]=0;for(i=1;i<=k;i++)if(i&(1<<p))q[++t]=a[i],dist[a[i]]=0,inq[a[i]]=1;while(h<=t){for(i=fir[q[h]];i;i=ne[i])if(dist[q[h]]+w[i]<dist[to[i]]){dist[to[i]]=dist[q[h]]+w[i];if(!inq[to[i]]){q[++t]=to[i]; inq[to[i]]=1;}}inq[q[h++]]=0; }int ans=1<<30;for(i=1;i<=k;i++)if(!(i&(1<<p)))ans=min(ans,dist[a[i]]);return ans;
}
int main()
{int i,x,y,z;scanf("%d%d%d",&n,&m,&k);for(i=1;i<=k;i++)scanf("%d",&a[i]);for(i=1;i<=m;i++){scanf("%d%d%d",&x,&y,&z); add(x,y,z); add(y,x,z);}int ans=1<<30;for(i=0;i<=log(k);i++)ans=min(ans,spfa(i));printf("%d",ans);
}