Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		sum := io.NextInt();
		if sum == 0 {
			break
		}
		for i := 0; i < 9; i++ {
			sum -= io.NextInt()
		}
		io.Println(sum)
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;

int main()
{
	//レシート

	int N;
	int sum = 0;
	int ans[5];
	int a;

	while (true)
	{
		cin >> N;
		if (N == 0) break;
		for (int j = 0; j < 9; j++) {
			cin >> a;
			sum += a;
		}
		cout << N - sum << endl;
	}

	//コンテスト	
	/*
	int W[10], K[10];
	for (int i = 0; i < 10; i++) {
		cin >> W[i];
	}
	for (int i = 0; i < 10; i++) {
		cin >> K[i];
	}
	sort(W, W + 10);
	reverse(W, W + 10);
	sort(K, K + 10);
	reverse(K, K + 10);
	cout << W[0] + W[1] + W[2] << " " << K[0] + K[1] + K[2] << endl;
	*/
	//ポイントカード
	/*
	int N, M;
	cin >> N >> M;
	int a;
	int A[5000];
	int b = 0;
	int x = 0;
	for (int i = 0; i <  M; i++) {
		cin >> a;
		if (a < N) {
			A[x]=a;
			x++;
		}
		else
		{
			b++;
		} 
		cin >> a;
	}
	int sum = 0;
	if (b < M - 1) {
		sort(A, A+x);
		reverse(A, A+x);
		for (int i = 0; i < M - 1 - b; i++) {
			sum += N - A[i];
		}
	}
	cout << sum << endl;
	*/

	//合計時間
	/*
	int sum=0, n;
	for (int i = 0; i < 4; i++) {
	cin >> n;
	sum += n;
	}
	cout << sum / 60 << endl;
	cout << sum % 60 << endl;
	//平均点
	/*
	int P[5];
	int sum=0;
	for (int i = 0; i < 5; i++) {
	cin >> P[i];
	if (P[i] < 40) P[i] = 40;
	sum += P[i];
	}
	cout << sum / 5 << endl;
	*/
	//投票
	/*
	int N, M;
	cin >> N >> M;
	int A[1000], vote[1000];
	for (int i = 0; i < N; i++) {
	cin >> A[i];
	vote[i] = 0;
	}
	int b;
	for (int i = 0; i < M; i++) {
	cin >> b;
	for (int j = 0; j < N; j++) {
	if (A[j] <= b) {
	vote[j]++;
	break;
	}
	}
	}
	int temps = 0, ans;
	for (int i = 0; i < N; i++) {
	if (vote[i] > temps) {
	temps = vote[i];
	ans = i;
	}
	}
	cout << ans + 1 << endl;
	*/

	//2.すごろく	
	/*
	int n;
	cin >> n;
	int A, _A = 1;
	int k = 0;
	int A_count[100];
	A_count[0] = 1;
	for (int i = 0; i < n; i++)
	{
	cin >> A;
	if (A == 1)
	{
	if (A == _A)
	{
	A_count[k]++;
	}
	else
	{
	k++;
	A_count[k] = 2;
	}
	}
	_A = A;
	}
	sort(A_count, A_count + k + 1);
	cout << A_count[k] << endl;
	*/

	//タイムカード
	/*
	int t[2][3];
	int x[3][3];
	for (int n=0; n < 3; n++)
	{
	for (int i=0; i < 2; i++)
	for (int k=0; k < 3; k++)
	cin >> t[i][k];

	for (int m = 2; m >= 0; m--)
	{
	x[n][m] = t[1][m] - t[0][m];
	if (t[0][m] > t[1][m])
	{
	x[n][m] += 60;
	t[1][m - 1]--;
	}
	}
	}
	for (int n= 0; n < 3; n++)
	{
	cout << x[n][0] << ' ' << x[n][1] <<' '<< x[n][2] << endl;
	}
	*/



	return 0;
}

C++: #include <iostream>
using namespace std;
 
int main() {
	while(1){
		int matsudo, unco;
		int kousin[9] = {};
		unco = 0;
		cin >> matsudo;
		for(int tora = 0; tora < 9; tora++)
			cin >> kousin[tora];
		if(matsudo == 0){
			return 0;
		}
		for(int tora = 0; tora < 9; tora++){
			unco = unco + kousin[tora];
		}
		cout << matsudo - unco << endl;
	}
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int amount,sum=0,a;
	cin>>amount;
	while(1){
		cin>>a;
		if(a==0){
			break;
		}
		sum+=a;
	}
	cout<<amount-sum<<endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int i, book, price;
int main(){
while(cin >> price) {
    if(price == 0) { break; }
    for (i=1; i<=9; i++) {
         cin >> book;
         price -= book;
        }
        cout << price << endl;
}
return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int x,a,b,c,d,e,f,g,h,i,j;
	scanf("%d %d %d %d %d %d %d %d %d %d",&x,&a,&b,&c,&d,&e,&f,&g,&h,&i);
	j=x-(a+b+c+d+e+f+g+h+i);
	printf("%d\n",j);
	return 0;
}

C++: //Problam.A
#include <bits/stdc++.h>
using namespace std;

int main(){
   int a;
   int book[10] =  {};
   for(int i=1;i<10;i++){
       cin>>book[i-1];
      while(1){
           if(book[i-1] == 0) break;

           for(int j=0;j<<10;j++){
              int k;
              k =+ book[j];
              int x;
              x = a - (k);
              cout<<x<<endl;
           }
           cout<<endl;
      }

   }
   cout<<endl;

   return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
  int all;
  while(cin>>all){
    while(true){
      int a; cin>>a;
      if(a==0) break;
      all-=a;
    }
    cout << all << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
 int h;
 int x;
 int y;
 int z;
 int a;
 int b;
 int c;
 int d;
 int f;
 int g;
 int i;
 cin>>h>>x>>y>>z>>a>>b>>c>>d>>f>>g;
int e =h-x-y-z-a-b-c-d-f-g-i;

cout<<e<<endl;
}

C++: #include<iostream>
using namespace std;
int main(){
	int A;
	int B;
	cin >> A;
	for (int i = 0; i < 9; i++){
		cin >> B;
		A -= B;
	}
	cout << A << endl;
	return 0;
}

C++: #include <iostream>
using namespace std;

int main() {
	int ans,sum,x=1;
	while(x!=0){
		int price=0;	
		cin>>sum;
		for(int i=0;i<9;i++){
			int a=0;
			cin>>a;
			price=price+a;
			x=a;
		}
		ans=sum-price;
		if(ans!=0){
			cout<<ans<<endl;
			}
	}
	
	
	return 0;
}

C++: #include<stdio.h>
int main(){
  int sum,a[9],i;
  while(1){
    scanf("%d",&sum);
    if(sum==0)break;
    for(i=0;i<9;i++){
      scanf("%d",&a[i]);
      sum-=a[i];
    }
    printf("%d\n",sum);
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int a;
	int b,c,d,e,f,g,h,i,j;
	cin>>a;
	cin>>b>>c>>d>>e>>f>>g>>h>>i>>j;
	cout<<a-b-c-d-e-f-g-h-i-j<<endl;

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <functional>
#include <algorithm>
using namespace std;

typedef long long ll;

int main()
{
    int sum, bks;
    while(cin >> sum && sum) {
        bks = 0;
        for(int i = 0; i < 9; i++) {
            int tmp;
            cin >> tmp;
            bks += tmp;
        }
            
        cout << (sum - bks) << endl;
    }
}

C++: #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
	int n;
  	while(cin>>n){
	int sum = 0;
    if(n==0) break;
	for (int i = 0; i < 9; i++) {
		int x;
		cin >> x;
		sum += x;
	}
	cout << n-sum << endl;
    }
}