#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<(n+1)*n/2+1;
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
for(int i=0;i<s.size()-5;i++)
{
string ss=s.substr(i,5);
if(ss=="black")
{
s[i+2]='o';
}
}
cout<<s;
return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=n;i;i--)
{
cout<<"**";
for(int j=1;j<=i;j++)cout<<" ";
for(int j=1;j<=i;j++)cout<<"*";
cout<<endl;
}
for(int i=1;i<=3;i++)cout<<"*";
cout<<endl;
for(int i=1;i<=n;i++)
{
cout<<"**";
for(int j=1;j<=i;j++)cout<<" ";
for(int j=1;j<=i;j++)cout<<"*";
cout<<endl;
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
using ll = long long;
ll a[N];
int main()
{
int n,m;ll k;
cin>>n>>m;
ll sum=0,x;
int l=1,r;
for(int i=1;i<=n;i++)
{
cin>>a[i]>>k;
r=i;
l=max(l,i-m);
while(l<=r)
{
x=min(a[l],k);
sum+=x;
a[l]-=x;
k-=x;
if(k==0)break;
l++;
}
}
cout<<sum;
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int N = 809;
using ll = long long;
int a[N][N];
int ans=1e9;
int n,m,k;
void get(int L,int R)
{
int l=1,r=1;
int an=0;
while(l<=n)
{
while(an<k&&r<=n)
{
an+=a[r][R]-a[r][L-1];
r++;
}
if(an<k)break;
// cout<<l<<" "<<L<<" "<<r<<" "<<R<<endl;
ans=min(ans,(R-L+1)*(r-l));
an-=a[l][R]-a[l][L-1];
l++;
}
}
int main()
{
int kk=0;
cin>>n>>m>>k;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
char x;
cin>>x;
if(x=='.')a[i][j]=1,kk++;
a[i][j]+=a[i][j-1];
}
}
if(kk<k)
{
cout<<"No Solution";
return 0;
}
for(int i=1;i<=m;i++)
{
for(int j=i;j<=m;j++)
{
get(i,j);
}
}
cout<<ans;
return 0;
}