/*
Task:platka
LANG:C++
*/
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
vector<int> a[20001];
int v[20001],br,u,j,k;
queue<int> q;
void BFS(int i)
{
     v[i]=1;
     q.push(i);
     while(!q.empty())
     {
                      u=q.front();
                      q.pop();
                      k=a[u].size();
                      for(j=0;j<k;j++)
                      if(!v[a[u][j]]){v[a[u][j]]=1;br++;q.push(a[u][j]);}
                      }
}
int main()
{
    int n,m,x,y;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
            cin>>x>>y;
            a[x].push_back(y);
            a[y].push_back(x);
            }
    BFS(1);
    br++;
    if(br>n/2)
    br=n-br;
    cout<<"Sorry, Pesho "<<br<<endl;
    return 0;
}
