#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;

int main()
{
  int n = 0, f = 0, l = 0;

  while ( cin >> n && n ) {
    vector<int> piles[100];

    for ( int i = 0; i < n; i++ ) {
      piles[i].push_back( i + 1 );
    }

    while ( cin >> f >> l && f ) {
      if ( f == l ) { continue; }

      int pf = 0, pl = 0;
      vector<int>::iterator itrf, itrl;
      
      for ( int i = 0; i < n; i++ ) {
	vector<int>::iterator itr = find( piles[i].begin(), piles[i].end(), f );
	if ( itr != piles[i].end() ) {
	  pf = i;
	  itrf = itr;
	  break;
	}
      }

      if ( l ) {
	for ( int i = 0; i < n; i++ ) {
	  vector<int>::iterator itr = find( piles[i].begin(), piles[i].end(), l );
	  if ( itr != piles[i].end() ) {
	    pl = i;
	    itrl = itr;
	    break;
	  }
	}

	if ( pf == pl ) {
	  if ( itrf < itrl ) {
	    vector<int> temp( itrf + 1, piles[pf].end() );
	    piles[pf].erase( itrf, piles[pf].end() );

	    for ( int i = 0, j = 0; i < n && j < temp.size(); i++ ) {
	      if ( !piles[i].size() ) {
		piles[i].push_back( temp[j] );
		if ( temp[j] == l ) { piles[i].push_back( f ); }
		j++;
	      }
	    }
	  }
	}
	
	else {
	  vector<int> temp( itrf + 1, piles[pf].end() );
	  piles[pf].erase( itrf, piles[pf].end() );
	  piles[pl].push_back( f );

	  for ( int i = 0, j = 0; i < n && j < temp.size(); i++ ) {
	    if ( !piles[i].size() ) {
	      piles[i].push_back( temp[j++] );
	    }
	  }
	}
      }
      
      else {
	if ( itrf != piles[pf].begin() ) {
	  vector<int> temp( itrf, piles[pf].end() );
	  piles[pf].erase( itrf, piles[pf].end() );
	  
	  for ( int i = 0, j = 0; i < n && j < temp.size(); i++ ) {
	    if ( !piles[i].size() ) {
	      piles[i].push_back( temp[j++] );
	    }
	  }
	}
      }
    }

    multiset<int> heights;
    for ( int i = 0; i < n; i++ ) {
      if ( piles[i].size() ) { heights.insert( piles[i].size() ); }
    }

    for ( multiset<int>::iterator itr = heights.begin(); itr != heights.end(); itr++ ) {
      cout << *itr << endl;
    }

    cout << "end" << endl;
  }

  return 0;
}