C++ :

#include <bits/stdc++.h>
using namespace std;
int r[101], c[101]; // r行, c列 
int main()
{
	int n, ans = 0;
	char ch;
	cin >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
		{
			cin >> ch;
			if (ch == '*') 
			{
				r[i]++, c[j]++; 
				ans = max(ans, max(r[i], c[j]));
			}
		}
	cout << ans << endl;
	return 0;
}

Pascal :

var
  a:array[1..1000,1..1000] of char;
  n,i,j,s,mi,mj:longint;
begin
  readln(n);
  for i:=1 to n do
    begin
      for j:=1 to n do
        begin
          read(a[i,j]);
          if a[i,j]='*' then
            inc(s);
        end;
        if s>mi then mi:=s;
        s:=0;
        readln;
    end;
  for i:=1 to n do
    begin
      for j:=1 to n do
        if a[j,i]='*' then
          inc(s);
      if s>mj then
        mj:=s;
      s:=0;
    end;
  if mj>mi then
    write(mj)
  else
    write(mi);
end.