#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+6;
using ll = long long;
int a[N];
int main()
{
int ans=1;
int x;
while(cin>>x)
{
if(x==6)ans*=10;
}
if(ans==1)cout<<"0";
else cout<<ans;
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+6;
using ll = long long;
int a[N];
int main()
{
int n,a,b;
cin>>n>>a>>b;
int ans=n;
int aa=n,bb=n;
while(aa/a!=0||bb/b!=0)
{
int x,y;
x=aa/a;
y=bb/b;
ans+=aa/a;
ans+=bb/b;
aa%=a;
bb%=b;
// cout<<aa<<" "<<bb<<" "<<x+y<<endl;
aa+=x+y;
bb+=x+y;
}
cout<<ans;
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+7;
struct point1{
int aa;
int id1;
}a[N];
struct point2{
int bb;
int id2;
}b[N];
struct point3{
int cc;
int id3;
}c[N];
bool cmp1(point1 x,point1 y)
{
return x.aa<y.aa;
}
bool cmp2(point2 x,point2 y)
{
return x.bb<y.bb;
}
bool cmp3(point3 x,point3 y)
{
return x.cc<y.cc;
}
string s[N];
bool vis[N];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>s[i]>>a[i].aa>>b[i].bb>>c[i].cc;;
a[i].id1=i;
b[i].id2=i;
c[i].id3=i;
}
sort(a+1,a+1+n,cmp1);
sort(b+1,b+1+n,cmp2);
sort(c+1,c+1+n,cmp3);
int id=n;
for(int i=n;i;i--)
{
while(a[i].aa-a[id].aa<100&&id)id--;
if(id==0)break;
while(a[i].aa-a[id].aa>=100&&id)vis[a[id--].id1]=1;
if(id==0)break;
}
id=n;
for(int i=n;i;i--)
{
while(b[i].bb-b[id].bb<100&&id)id--;
if(id==0)break;
while(b[i].bb-b[id].bb>=100&&id)vis[b[id--].id2]=1;
if(id==0)break;
}
id=n;
for(int i=n;i;i--)
{
while(c[i].cc-c[id].cc<100&&id)id--;
if(id==0)break;
while(c[i].cc-c[id].cc>=100&&id)vis[c[id--].id3]=1;
if(id==0)break;
}
int f=0;
for(int i=1;i<=n;i++)
{
if(vis[i]==0)
{
f=1;
break;
}
}
if(f)
{
cout<<"Winning list:"<<endl;
for(int i=1;i<=n;i++)
{
if(vis[i]==0)cout<<s[i]<<endl;
}
}
else cout<<"There is no winner.";
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+7;
char s[1200][3000];
int main()
{
int n;
cin>>n;
if(n==1)
{
cout<<" /\\"<<endl;
cout<<"/__\\";
return 0;
}
int d=1<<(n-1);
d*=2;
for(int i=1;i<d;i++)s[1][i]=' ';
s[1][d]='/';
s[1][d+1]='\\';
for(int i=d+2;i<=pow(2,n+1);i++)s[1][i]=' ';
for(int i=1;i<=d-2;i++)s[2][i]=' ';
s[2][d-1]='/';
s[2][d+2]='\\';
s[2][d]='_';
s[2][d+1]='_';
for(int i=d+3;i<=pow(2,n+1);i++)s[2][i]=' ';
for(int i=1;i<=2;i++)
{
for(int j=1;j<=pow(2,n+1);j++)cout<<s[i][j];
cout<<endl;
}
for(int i=2;i<=n;i++)
{
for(int k=1;k<=(int)pow(2,i-1);k++)
{
for(int j=1;j<=pow(2,n);j++)
{
s[(int)pow(2,i-1)+k][j]=s[k][j+(int)pow(2,i-1)];
cout<<s[(int)pow(2,i-1)+k][j];
}
for(int j=pow(2,n)+1;j<=pow(2,n+1);j++)
{
s[(int)pow(2,i-1)+k][j]=s[k][j-(int)pow(2,i-1)];
cout<<s[(int)pow(2,i-1)+k][j];
}
cout<<endl;
}
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+7;
int a[N];
bool cmp(int x,int y)
{
return x>y;
}
int main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
int x;
cin>>x;
a[x]++;
}
sort(a+1,a+n+1,cmp);
int ans=0;
for(int i=k+1;i<=n;i++)ans+=a[i];
cout<<ans;
return 0;
}