// clang-format off
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#ifndef ONLINE_JUDGE
// #define broot
#endif

#ifndef broot
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif

#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef gp_hash_table<int, int> umap;
typedef tree<int, null_type, less<int>, rb_tree_tag,
        tree_order_statistics_node_update> oset;
// not that imp
typedef pair<pii, int> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef complex<ld> cd;

#define INF 4557430888798830399ll
#define MOD 1000000007
#define EPS 1e-7
#define PI 3.1415926535897932385
// #define PI acos(-1)

#define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define sz(x) (int)(x).size()
#define len(x) (int)x.length()

#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fil(ar, val) memset(ar, val, sizeof(ar))  // 0x3f for inf, 0x80 for -INF can also use with pairs
#define trav(a, x) for(auto& a : x)
// #define rep(i, a, b) for(int i = a; i < (b); ++i)  // For kactl
// #define FOR(i, a, b) for (int i = (a); i < (b); i++)  // For Benq
// #define F0R(i, a) for (int i = 0; i < (a); i++)  // For Benq
// #define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)  // For Benq
// #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)  // For Benq

#ifdef broot
template<typename T>
void __p(T a) { cout << a << " "; }
template<typename T>
void __p(std::vector<T> a) { cout << "{ "; for (auto p : a) __p(p); cout << "}"; }
template<typename T, typename F>
void __p(pair<T, F> a) { cout << "{ "; __p(a.first); __p(a.second); cout << "}"; }
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) { __p(a1); __p(a...); }
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
    cout<<name<<" : ";__p(arg1);cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
    int bracket=0,i=0;
    for(; ;i++)
        if(names[i]==','&&bracket==0)
            break;
        else if(names[i]=='(')
            bracket++;
        else if(names[i]==')')
            bracket--;
    const char *comma=names+i;
    cout.write(names,comma-names)<<" : ";
    __p(arg1);
    cout<<"| ";
    __f(comma+1,args...);
}
#define trace(...) cout<<"Line:"<<__LINE__<<" "; __f(#__VA_ARGS__, __VA_ARGS__)
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif

mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
ll modpow(ll b, ll e, ll mod=MOD) {
    ll ans=1; for(;e;b=b*b%mod,e/=2) if(e&1) ans=ans*b%mod; return ans; }
// clang-format on

const int maxn = 1000005;

const ll N = 550;
ll n;
ll a[N][N];

void op(ll r, ll c)
{
    fr(i,1,n)
    {
        a[i][c] = a[r][i];
    }
}

void solve() 
{
    cin >> n;
    fr(i,1,n)
    {
        fr(j,1,n)
        {
            char c;
            cin >> c;
            if(c=='#')
                a[i][j] = 1;
            else
                a[i][j] = 0;
        }
    }

    bool xx = 0;
    fr(i,1,n)
    {
        fr(j,1,n)
        {
            if(a[i][j])
                xx = 1;
        }
    }
    if(!xx)
    {
        cout << -1 << endl;
        return;
    }

    ll can[n+1];
    fil(can,0);
    
    fr(i,1,n)
    {
        fr(j,1,n)
        {
            if(a[i][j])
                can[j] = i;
        }
    }
    pair<ll,ll> b[n+1];

    fr(i,1,n)
    {
        ll su = 0;
        fr(j,1,n)
        {
            su += a[i][j];
        }
        b[i] = mp(su,i);
    }

    sort(b+1,b+n+1);

    ll mini = INF;
    frr(i,n,1)
    {
        if(can[b[i].ss])
        {
            mini = min(mini,n-b[i].ff);
        }
        else
        {
            mini = min(mini,n-b[i].ff+1);
        }
    }

    ll ans = mini;
    fr(i,1,n)
    {
        bool hu = 0;
        fr(j,1,n)
        {
            if(!a[j][i])
                hu = 1;
        }
        if(hu)
            ans++;
    }

    cout << ans << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0), cout.precision(10);  // cout<<fixed;
#ifdef broot
    // cin.exceptions(cin.failbit);
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int t=1;
    // cin>>t; 
    fr(i,1,t){
        // cout<<"Case #"<<i<<": ";
        solve();
    }
    end_routine();
}

Measured memory_bytes: 2432