#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

#define sp cout<<"---------------------------------------------------"<<endl;

const int inf=0x3f3f3f3f;

const int dx[]={-,,,-,,-,,},dy[]={-,-,-,,,,,};

class DesertWind {

    public:

        int a[][],ans[][],n,m;

        bool is(int x,int y){

            if(x<||y<||x>n||y>m||a[x][y]==inf)return false;

            return true;

        }

        int daysNeeded(vector<string>theMap){

            n=theMap.size(),m=theMap[].length();

            int i,j,sx,sy,k;

            memset(ans,0x3f,sizeof(ans));

            memset(a,0x3f,sizeof(a));

            for(i=;i<n;i++)

              for(j=;j<m;j++)

                if(theMap[i][j]=='@')sx=i+,sy=j+,a[i+][j+]=;

                  else if(theMap[i][j]=='-')a[i+][j+]=;

                  else if(theMap[i][j]=='*'){

                    a[i+][j+]=;

                    ans[i+][j+]=;

                  }

            for(int _=;_<=n*m;_++)

              for(i=;i<=n;i++)

                for(j=;j<=m;j++)

                  if(a[i][j]!=inf){

                      int cnt=,d[];

                      for(k=;k<=;k++)d[k]=inf;

                      for(k=;k<;k++){

                        int x=i+dx[k],y=j+dy[k];

                        if(is(x,y))d[++cnt]=ans[x][y];

                    }

                    sort(d+,d+cnt+);

                    ans[i][j]=min(ans[i][j],min(d[]+,d[]+));

                  }

            return ans[sx][sy]==inf?-:ans[sx][sy];

        }

};