#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
vector<int>arr={2,6,4,4,0};
unordered_map<int,int>mp;
int k;
cin>>k;
int count=0;
int n=arr.size();
mp[0]=1;
int prefixsum=0;
for(int i=0;i<n;i++)
{
prefixsum=prefixsum+arr[i];
if(mp.find(prefixsum-k)!=mp.end())
{
count+=mp[prefixsum-k];
}
mp[prefixsum]++;
}
cout<<count;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGludCBsbDsKCmludCBtYWluKCkgewogICB2ZWN0b3I8aW50PmFycj17Miw2LDQsNCwwfTsKCXVub3JkZXJlZF9tYXA8aW50LGludD5tcDsKCWludCBrOwoJY2luPj5rOwoJaW50IGNvdW50PTA7CglpbnQgbj1hcnIuc2l6ZSgpOwoJbXBbMF09MTsKCWludCBwcmVmaXhzdW09MDsKCWZvcihpbnQgaT0wO2k8bjtpKyspCgkgewoJIAlwcmVmaXhzdW09cHJlZml4c3VtK2FycltpXTsKCSAJaWYobXAuZmluZChwcmVmaXhzdW0taykhPW1wLmVuZCgpKQoJIAkgewoJIAkgCWNvdW50Kz1tcFtwcmVmaXhzdW0ta107CgkgCSB9CgkgCSBtcFtwcmVmaXhzdW1dKys7CgkgfQoJIAoJIGNvdXQ8PGNvdW50Owp9Cg==