#include <iostream>
int sumNums(int *nums,int left,int right);
using namespace std;
int main(int argc, char** argv) {
	int val = 0,count = 0, index = 0;
	int primnums[10001], primenum2[10001];
	int primnum = 2,nums = 0;
	int rightindex = 0,leftindex = 0;
	int xmax = 0, xmin = 0;
	int sum = 0;
	primnums[0] = 1;
	primnums[1] = 1;
	for (int i = 2; i <= 10000; i++) {
		if (primnums[i] == 0) {
			for (int j = 2 * i; j <= 10000; j += i) {
				primnums[j] = 1;
			}
		}
	}
	for (int i = 0; i <= 10000; i++) {
		if (primnums[i] == 0) {
			primenum2[index] = i;
			index++;
		}
	}
	while (cin >> val && val != 0) {
		rightindex = 0;
		while (primenum2[rightindex] < val) {
			rightindex++;
		}
		xmax = rightindex;
		leftindex = xmin;
		while (leftindex >= xmin && rightindex <= xmax && leftindex <= rightindex){
			sum = sumNums(primenum2,leftindex,rightindex);
			if (sum == val) {
				count++;
				leftindex++;
				rightindex++;
				continue;
			}
			if (sum > val) {
				rightindex--;
			}
			else {
				leftindex++;
				rightindex++;
			}
		}
		rightindex = 0;
		cout << count << endl;
		count = 0;
	}	
	return 0;
}
int sumNums(int* nums, int left, int right) {
	int res = 0;
	if(left == right)
		return nums[left];
	for (int m = left; m <= right; m++) {
		res += nums[m];
	}
	return res;
}