Go: package main

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

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		n := io.NextInt()
		if n == 0 {
			break
		}
		a := make([]int, n)
		sum := 0
		for i := 0; i < n; i++ {
			a[i] = io.NextInt()
			sum += a[i]
		}
		cnt := 0
		for i := 0; i < n; i++ {
			if a[i] <= sum/n {
				cnt++
			}
		}
		io.Println(cnt)
	}
}

// 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 <algorithm>
#include <cstring>
#include <cmath>
#include <cstdio>

using namespace std;

const int MAX_N = 10005;
int arr[MAX_N];

int main() {
    int n;
    scanf("%d", &n);
    while (n != 0) {
        int sum = 0;
        for (int i = 0; i < n; ++i) {
            scanf("%d", arr + i);
            sum += arr[i];
        }
        int cnt = 0;
        for (int j = 0; j < n; ++j) {
            if (arr[j] * n <= sum)
                cnt++;
        }
        printf("%d\n", cnt);
        scanf("%d", &n);
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(-1.0L);
ll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }
ll LCM(ll a, ll b) { return a/GCD(a, b)*b; }

int n;

int main() {
    while(1) {
        cin >> n;
        if(n == 0) break;
        vector<int> a(n, 0);
        int sum = 0;
        for(int i = 0; i < n; ++i) {
            cin >> a[i];
            sum += a[i];
        }
        int ch = sum/n;
        sort(a.begin(), a.end());
        int no = upper_bound(a.begin(), a.end(), ch) - a.begin();
        cout << no << endl;
    }
}

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

#define maxn 10010
int n,sum,eve,cnt;
int num[maxn];

int main()
{
    while(cin>>n&&n)
    {
        sum=0;  eve=0;  cnt=0;
        for(int i=0;i<n;i++)
        {
            cin>>num[i];
            sum+=num[i];
        }
        eve=sum/n;
        for(int i=0;i<n;i++)
        {
            if(num[i]<=eve) cnt++;
        }
        cout<<cnt<<'\n';
    }
    getchar();getchar();
    return 0;
}

C++: #include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}



signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  while(1){
    int n;
    cin>>n;
    if(n == 0) break;
    vector<int> A(n);
    cin>>A;

    int sum = 0;
    for(int i=0;i<n;i++) sum += A[i];

    int ans = 0;
    for(int i=0;i<n;i++)
      if(A[i] * n <= sum) ans++;

    cout<<ans<<endl;
  }
  return 0;
}

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

int main() {
  int n;

  while (cin >> n, n) {
    vector<int64_t> a(n);
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
    }

    int64_t sum = accumulate(a.begin(), a.end(), 0ll);
    int ans = 0;
    for (int i = 0; i < n; ++i) {
      if (a[i] * n <= sum) ans++;
    }

    cout << ans << endl;
  }
}

C++: #include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;
#define ll long long
#define pb push_back

int main()
{
    int n;
    vector<int> x;

    while (1)
    {
        cin >> n;
        if (n == 0)
        {
            break;
        }
        int sum = 0;
        vector<int> a(n);
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
            sum += a[i];
        }
        int ave = sum / n;
        int cnt = 0;
        for (int j = 0; j < n; j++)
        {
            if (a[j] <= ave)
            {
                cnt++;
            }
        }
        x.push_back(cnt);
    }
    for (int i=0; i< x.size(); i++)
    {
        cout << x[i] << endl;
    }
}

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

int main(){
  int income[10000];
  int n;
  while(1){
    cin >> n;
    if(n==0) break;
    int total=0;
    for(int i=0;i<n;i++){
      cin >> income[i];
      total += income[i];
    }
    int ave = total/n;
    int count=0;
    for(int i=0;i<n;i++){
      if(ave>=income[i])
        count++;
      }
      cout << count << endl;
    }
}

C++: #include <iostream>
using namespace std;
int main(void){
    int shotoku[10000];

    while(true){
        int sum=0;
        int s=0;
        int n;
        cin >> n;
        if(n==0)break;
        for(int i=0;i<n;i++){
            cin >> shotoku[i];
            sum += shotoku[i];
        }
        int x=sum/n;
        for(int j=0; j<n;j++){
            if(shotoku[j]<=x){
            s=s+1;
        }
        else{
        }
        }
    cout << s << endl;

    }
}